2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07) Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd Silicon Valley, California, USA November 02-November 05 ISBN: 0-7695-3027-3
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IAT.2007.68
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.
Citation:
Muhammed Basharu, Ines Arana, Hatem Ahriz, "Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd," iat, pp.335-341, 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb