10 search results - page 1 / 2 » Min-Domain Ordering for Asynchronous Backtracking |
CP
2007
Springer
14 years 5 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...
CP
2005
Springer
14 years 4 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...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
JETAI
2008
13 years 11 months ago
2008
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
SECON
2010
IEEE
13 years 8 months ago
2010
IEEE
Existing solutions to carrier-based sensor placement by a single robot, in a bounded unknown region of interest (ROI), do not guarantee full area coverage and/or do not terminate. ...