75 search results - page 1 / 15 » Queuing Local Solutions in Distributed Constraint Satisfacti... |
72
Voted
AI
2005
Springer
15 years 6 months ago
2005
Springer
129
click to vote
AAAI
1994
15 years 1 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
115
click to vote
AAAI
2006
15 years 1 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
115
click to vote
AUSAI
2003
Springer
15 years 5 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...