Sciweavers

7 search results - page 2 / 2
» Dynamic Ordering for Asynchronous Backtracking on DisCSPs
Sort
View
AUSAI
2003
Springer
15 years 2 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar
CP
1995
Springer
15 years 1 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo