Sciweavers

14 search results - page 1 / 3
» Cooperative problem solving against adversary: quantified di...
Sort
View
ATAL
2010
Springer
13 years 5 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...
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
AAAI
1997
13 years 6 months ago
Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
Aaron A. Armstrong, Edmund H. Durfee
AAAI
1996
13 years 6 months ago
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
Peggy S. Eaton, Eugene C. Freuder
ECAI
2004
Springer
13 years 10 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière