A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Including Soft Global Constraints in DCOPs
[chapter]
2012
Lecture Notes in Computer Science
In the centralized context, global constraints have been essential for the advancement of constraint reasoning. In this paper we propose to include soft global constraints in distributed constraint optimization problems (DCOPs). Looking for efficiency, we study possible decompositions of global constraints, including the use of extra variables. We extend the distributed search algorithm BnB-ADOPT + to support these representations of global constraints. In addition, we explore the relation of
doi:10.1007/978-3-642-33558-7_15
fatcat:brnp2pe4fvenpoadcu44bhcxnm