Show simple item record

dc.contributor.authorLee, David
dc.contributor.authorArana, Ines
dc.contributor.authorAhriz, Hatem
dc.contributor.authorHui, Kit-Ying
dc.date.accessioned2008-12-23T16:41:50Z
dc.date.available2008-12-23T16:41:50Z
dc.date.issued2008
dc.identifier.citationLEE, D., ARANA, I., AHRIZ, H. and HUI, K. 2008. A hybrid approach to distributed constraint satisfaction. In: Proceedings of the 13th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA). 4-6 September 2008. Varna, Bulgaria. pp. 375-379en
dc.identifier.isbn9783540857754en
dc.identifier.urihttp://hdl.handle.net/10059/283
dc.description.abstractWe present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we propose the hybrid algorithm PenDHyb where the distributed local search algorithm DisPeL is run for a very small amount of time in order to learn about the difficult areas of the problem from the penalty counts imposed during its problem-solving. This knowledge is then used to guide the systematic search algorithm SynCBJ. Extensive empirical results in several problem classes indicate that PenDHyb is effective for large problems.en
dc.format.extent47983 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.relation.ispartofPtoceedings of the 13th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA)en
dc.relation.ispartofLecture Notes in Computer Science Volume 5253/2008en
dc.rightsCopyright : Springer Verlag. The original publication is available at www.springerlink.comen
dc.subjectConstraint satisfactionen
dc.subjectDistributed AIen
dc.subjectHybrid systemsen
dc.titleA hybrid approach to distributed constraint satisfaction.en
dc.typeConference publicationsen
dc.publisher.urihttp://dx.doi.org/10.1007/978-3-540-85776-1_33en


Files in this item

This item appears in the following Collection(s)

Show simple item record