Sciweavers

749 search results - page 142 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
ECP
1997
Springer
92views Robotics» more  ECP 1997»
13 years 12 months ago
Understanding and Extending Graphplan
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
Subbarao Kambhampati, Eric Parker, Eric Lambrecht
CP
2004
Springer
13 years 11 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
CP
2006
Springer
13 years 11 months ago
Retroactive Ordering for Dynamic Backtracking
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...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
CP
1995
Springer
13 years 11 months ago
On the Forward Checking Algorithm
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
Fahiem Bacchus, Adam J. Grove
CP
1995
Springer
13 years 11 months ago
Dynamic Variable Ordering in CSPs
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
Fahiem Bacchus, Paul van Run