Global Constraints in Distributed Constraint Satisfaction and Optimization.
Saved in:
| 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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 96236257 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Global Constraints in Distributed Constraint Satisfaction and Optimization. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Bessiere%2C+Christian%22">Bessiere, Christian</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Brito%2C+Ismel%22">Brito, Ismel</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Gutierrez%2C+Patricia%22">Gutierrez, Patricia</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Meseguer%2C+Pedro%22">Meseguer, Pedro</searchLink><relatesTo>2</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Computer+Journal%22">Computer Journal</searchLink>. Jun2014, Vol. 57 Issue 6, p906-923. 18p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Constraint+programming%22">Constraint programming</searchLink><br /><searchLink fieldCode="DE" term="%22Program+transformation%22">Program transformation</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+security%22">Computer security</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+memory+management%22">Computer memory management</searchLink><br /><searchLink fieldCode="DE" term="%22Motherboards%22">Motherboards</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=96236257 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1093/comjnl/bxt088 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 18 StartPage: 906 Subjects: – SubjectFull: Constraint programming Type: general – SubjectFull: Program transformation Type: general – SubjectFull: Computer security Type: general – SubjectFull: Computer memory management Type: general – SubjectFull: Motherboards Type: general Titles: – TitleFull: Global Constraints in Distributed Constraint Satisfaction and Optimization. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Bessiere, Christian – PersonEntity: Name: NameFull: Brito, Ismel – PersonEntity: Name: NameFull: Gutierrez, Patricia – PersonEntity: Name: NameFull: Meseguer, Pedro IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 06 Text: Jun2014 Type: published Y: 2014 Identifiers: – Type: issn-print Value: 00104620 Numbering: – Type: volume Value: 57 – Type: issue Value: 6 Titles: – TitleFull: Computer Journal Type: main |
| ResultId | 1 |
