7 search results - page 1 / 2 » DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSP... |
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....
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...
FLAIRS
2004
13 years 5 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...
CP
2004
Springer
13 years 8 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
CP
2007
Springer
13 years 10 months ago
2007
Springer
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...