OpenAIR @ RGU >
Design and Technology >
Conference publications (Computing) >
Please use this identifier to cite or link to this item:
|Title: ||Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd.|
|Authors: ||Basharu, Muhammed|
Distributed Constraint Satisfaction Problems
|Issue Date: ||2007|
|Publisher: ||IEEE Computer Society|
|Citation: ||BASHARU, M., ARANA, I and AHRIZ, A., 2007. Solving coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd. In: TSAU YOUNG LIN, JEFFREY M. BRADSHAW, MATTHIAS KLUSCH, CHENGQUI ZHANG, ANDREI BRODER and HOWARD HO, eds. 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2007 Main Conference Proceedings). 2-5 November 2007. California, USA. Pp. 335-341.|
|Abstract: ||We present Multi-DisPel, a penalty-based local search
distributed algorithm which is able to solve coarse-grained
Distributed Constraint Satisfaction Problems (DisCSPs) efficiently.
Multi-DisPeL uses penalties on values in order
to escape local optima during problem solving rather than
the popular weights on constraints. We also introduce
DisBO-wd, a stochastic algorithm based on DisBO (Distributed
Breakout) which includes a weight decay mechanism.
We compare Multi-DisPeL and DisBO-wd with other
algorithms and show, empirically, that they are more efficient
and at least as effective as state of the art algorithms
in some problem classes.|
|Appears in Collections:||Conference publications (Computing)|
All items in OpenAIR are protected by copyright, with all rights reserved.