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

Please use this identifier to cite or link to this item:
This item has been viewed 1 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
AAAI05.pdf110.37 kBAdobe PDFView/Open
Title: Solving DisCSPs with penalty-driven search.
Authors: Basharu, Muhammed
Arana, Ines
Ahriz, Hatem
Keywords: Distributed constraint satisfaction problems
Distributed penalty-driven local search algorithm
Issue Date: Jul-2005
Publisher: AAAI Press
Citation: BASHARU,M., ARANA, I. and AHRIZ, H. 2005. Solving DisCSPs with penalty-driven search. In: Proceedings of the Twentieth National Conference of Artificial Intelligence. 9-11 July 2005. Pittsburgh, Pennsylvania. pp. 47-52
Abstract: We introduce the Distributed, Penalty-driven Local search algorithm (DisPeL) for solving Distributed Constraint Satisfaction Problems. DisPeL is a novel distributed iterative improvement algorithm which escapes local optima by the use of both temporary and incremental penalties and a tabu-like no-good store. We justify the use of these features and provide empirical results which demonstrate the competitiveness of the algorithm.
ISBN: 9781577352365
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, Garthdee House, Garthdee Road, Aberdeen, AB10 7QB, Scotland, UK: a Scottish charity, registration No. SC013781