9 search results - page 1 / 2 » Asynchronous Forward-checking for DisCSPs |
CP
2009
Springer
14 years 5 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
CP
2005
Springer
13 years 10 months ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
AIMSA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
CONSTRAINTS
2007
13 years 4 months ago
2007
FLAIRS
2004
13 years 6 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...