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 2 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
FLAIRS05.pdf112.77 kBAdobe PDFView/Open
Title: Distributed guided local search for solving binary DisCSPs.
Authors: Basharu, Muhammed
Arana, Ines
Ahriz, Hatem
Keywords: Distributed guided local search algorithm
Distributed constraint satisfaction problems
Issue Date: May-2005
Publisher: AAAI Press
Citation: BASHARU, M., ARANA, I. and AHRIZ, H. 2005. Distributed guided local search for solving binary DisCSPs. In: Proceedings of the 18th International FLAIRS Conference. 16-18 May 2005. Florida. pp. 660-665
Abstract: We introduce the Distributed Guided Local Search (Dist- GLS) algorithm for solving Distributed Constraint Satisfaction Problems. Our algorithm is based on the centralised Guided Local Search algorithm, which is extended with additional heuristics in order to enhance its efficiency in distributed scenarios. We discuss the strategies we use for dealing with local optima in the search for solutions and compare performance of Dist-GLS with that of Distributed Breakout (DBA). In addition, we provide the results of our experiments with distributed versions of random binary constraint satisfaction and graph colouring problems.
ISBN: 9781577352341
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