53 search results - page 2 / 11 » Asynchronous Partial Overlay: A New Algorithm for Solving Di... |
113
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
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...
131
Voted
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
140
Voted
ICDCS
2000
IEEE
15 years 7 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
138
Voted
AUSAI
2003
Springer
15 years 8 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
140
Voted
FLAIRS
2004
15 years 4 months ago
2004
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...