Sciweavers

44 search results - page 2 / 9
» Asynchronous Weak-commitment Search for Solving Distributed ...
Sort
View
JAIR
2006
131views more  JAIR 2006»
13 years 4 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
FLAIRS
2004
13 years 6 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
ATAL
2010
Springer
13 years 6 months ago
Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Marius...
AAMAS
2000
Springer
13 years 4 months ago
Algorithms for Distributed Constraint Satisfaction: A Review
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
Makoto Yokoo, Katsutoshi Hirayama
AI
2005
Springer
13 years 4 months ago
Asynchronous aggregation and consistency in distributed constraint satisfaction
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
Marius-Calin Silaghi, Boi Faltings