Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd
Basharu, M.; Arana, I.; Ahriz, H.;
Intelligent Agent Technology, 2007. IAT '07. IEEE/WIC/ACM International Conference on
2-5 Nov. 2007 Page(s):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.
Abstract | Full Text: PDF(432 KB)    IEEE CNF
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved