23 search results - page 1 / 5 » Improving Asynchronous Backtracking for Dealing with Complex... |
93
Voted
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...
77
Voted
IJCAI
2001
15 years 1 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
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...
101
click to vote
AAMAS
2000
Springer
15 years 8 days ago
2000
Springer
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...
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...