Bibliographic Details
| Title: |
Global Constraints in Distributed Constraint Satisfaction and Optimization. |
| Authors: |
Bessiere, Christian1, Brito, Ismel2, Gutierrez, Patricia2, Meseguer, Pedro2 |
| Source: |
Computer Journal. Jun2014, Vol. 57 Issue 6, p906-923. 18p. |
| Subjects: |
Constraint programming, Program transformation, Computer security, Computer memory management, Motherboards |
| Abstract: |
Global constraints are an essential component in the efficiency of centralized constraint programming. We propose to include global constraints in distributed constraint satisfaction problem (DisCSP) and distributed constraint optimization problem (DCOP). We detail how this inclusion can be done, considering different representations for global constraints (direct, nested, binary). We explore the relation of global constraints with local consistency (both in the hard and soft cases), in particular, for generalized arc consistency (GAC). We provide experimental evidence of the benefits of global constraints on several benchmarks, both for distributed constraint satisfaction and for distributed constraint optimization. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
