Asynchronous aggregation and consistency in distributed constraint satisfaction

by: Marius-Calin Silaghi, Boi Faltings

Artificial Intelligence, Vol. 161, No. 1-2. (January 2005), pp. 25-53.

View FullText article

DOI, ScienceDirect

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

Find related articles with these CiteULike tags

distributed, tesi

Abstract

Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly, many of these tasks pose themselves in a distributed setting where variables and constraints are distributed among different agents. A variety of asynchronous search algorithms have been proposed for addressing this setting. We show how two techniques commonly used in centralized constraint satisfaction, value aggregation and maintaining arc consistency can be applied to increase efficiency in an asynchronous, distributed context as well, and report on experiments that quantify the gains.

@article{citeulike:2443922, abstract = {Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly, many of these tasks pose themselves in a distributed setting where variables and constraints are distributed among different agents. A variety of asynchronous search algorithms have been proposed for addressing this setting. We show how two techniques commonly used in centralized constraint satisfaction, value aggregation and maintaining arc consistency can be applied to increase efficiency in an asynchronous, distributed context as well, and report on experiments that quantify the gains.}, author = {Silaghi, Marius-Calin and Faltings, Boi }, booktitle = {Distributed Constraint Satisfaction}, citeulike-article-id = {2443922}, doi = {http://dx.doi.org/10.1016/j.artint.2004.10.003}, journal = {Artificial Intelligence}, keywords = {distributed, tesi}, month = {January}, number = {1-2}, pages = {25--53}, posted-at = {2008-02-28 15:20:06}, priority = {2}, title = {Asynchronous aggregation and consistency in distributed constraint satisfaction}, url = {http://dx.doi.org/10.1016/j.artint.2004.10.003}, volume = {161}, year = {2005} }

RIS record

TY - JOUR ID - citeulike:2443922 L3 - citeulike-article-id:2443922 TI - Asynchronous aggregation and consistency in distributed constraint satisfaction T2 - Distributed Constraint Satisfaction JF - Artificial Intelligence VL - 161 IS - 1-2 SP - 25 EP - 53 N2 - Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly, many of these tasks pose themselves in a distributed setting where variables and constraints are distributed among different agents. A variety of asynchronous search algorithms have been proposed for addressing this setting. We show how two techniques commonly used in centralized constraint satisfaction, value aggregation and maintaining arc consistency can be applied to increase efficiency in an asynchronous, distributed context as well, and report on experiments that quantify the gains. KW - distributed KW - tesi AU - Silaghi, Marius-Calin AU - Faltings, Boi PY - 2005/01// UR - http://dx.doi.org/10.1016/j.artint.2004.10.003 ER -

RIS BibTeX