Sciweavers

12 search results - page 1 / 3
» Interleaved Backtracking in Distributed Constraint Networks
Sort
View
IJAIT
2002
82views more  IJAIT 2002»
13 years 5 months ago
Interleaved Backtracking in Distributed Constraint Networks
The adaptation of software technology to distributed environments is an important challenge today. In this work we combine parallel and distributed search. By this way we add the ...
Youssef Hamadi
CP
2005
Springer
13 years 10 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
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...
Roie Zivan, Amnon Meisels
CP
2004
Springer
13 years 9 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
AI
2007
Springer
13 years 11 months ago
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
Yang Xiang, Wanling Zhang
AI
2005
Springer
13 years 5 months ago
Asynchronous backtracking without adding links: a new member in the ABT family
Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constr...
Christian Bessière, Arnold Maestre, Ismel B...