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
dcr06.pdf496.87 kBAdobe PDFView/Open
Title: Stoch-DisPeL: exploiting randomisation in DisPeL.
Authors: Basharu, Muhammed
Arana, Ines
Ahriz, Hatem
Keywords: DisPeL
Distributed constraint programming algorithm
Issue Date: 2006
Citation: BASHARU, M., ARANA, I. and AHRIZ, H., 2006. Stoch-DisPeL: exploiting randomisation in DisPeL. In: Proceedings of 7th International Workshop on Distributed Constraint Reasoning, DCR2006. 8 May 2006. Hakodate, Japan. pp. 117-131.
Abstract: We present Stoch-DisPeL, an extension of the distributed constraint programming algorithm DisPeL which incorporates randomisation into the algorithm. We justify the introduction of stochastic moves and analyse its performance on random DisCSPs and on Distributed SAT problems. We also empirically compare Stoch-DisPeL's performance to that of DisPel and DSA-B1N - our improved version of DSA. The results obtained show a clear advantage of the introduction of random moves in DisPeL. Our new algorithm, Stoch-DisPeL, also performs better than DSA-B1N.
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