Solving Coarse-grained DisCSPs with Multi-DisPeL and DisBO-wd
Basharu, M.; Arana, I.; Ahriz, H.
Intelligent Agent Technology, 2007. IAT apos;07. IEEE/WIC/ACM International Conference on
Volume , Issue , 2-5 Nov. 2007 Page(s):335 - 341
Digital Object Identifier   10.1109/IAT.2007.68
Summary: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.

» View citation and abstract

Log in by entering your IEEE Web Account Username and Password.

IEEE Communications Society members: If you subscribe to the IEEE Electronic Periodicals Package or IEEE Electronic Periodicals Package Plus, you must access your subscription at www.comsoc.org.

Check with your librarian, information professional, or system manager to determine if you need to log in. Please complete the online Technical Support Form if you need assistance.

Select the Purchase History link to access the document. You will have 5 Days after purchase to access the Full Text PDF. Please complete the online Technical Support Form if you need assistance.

• Search and access Abstract records free of charge
• Register for table of contents alerts
• Purchase Full Text PDF documents

» Learn more about subscription options or how to become an IEEE Member.