OpenAIR OpenAIR
 
 

OpenAIR @ RGU >
Design and Technology >
Computing >
Conference publications (Computing) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10059/283
This item has been viewed 2 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
AIMSA08-LeeAranaAhrizHui.pdf46.86 kBAdobe PDFView/Open
Title: A hybrid approach to distributed constraint satisfaction.
Authors: Lee, David
Arana, Ines
Ahriz, Hatem
Hui, Kit-Ying
Keywords: Constraint satisfaction
Distributed AI
Hybrid systems
Issue Date: 2008
Publisher: Springer Verlag
Citation: LEE, 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-379
Abstract: We 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.
ISBN: 9783540857754
Appears in Collections:Conference publications (Computing)

All items in OpenAIR are protected by copyright, with all rights reserved.

 

 
   Disclaimer | Freedom of Information | Privacy Statement |Copyright ©2012 Robert Gordon University, Schoolhill, Aberdeen, AB10 1FR, Scotland, UK: a Scottish charity, registration No. SCO13781