Sciweavers

150 search results - page 30 / 30
» Solving Permutation Constraint Satisfaction Problems with Ar...
Sort
View
CP
1995
Springer
13 years 8 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
FLAIRS
2004
13 years 6 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
FOCS
1998
IEEE
13 years 9 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
CSCLP
2004
Springer
13 years 10 months ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
CP
2003
Springer
13 years 10 months ago
Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms
Arc consistency plays a central role in solving Constraint Satisfaction Problems. This is the reason why many algorithms have been proposed to establish it. Recently, an algorithm ...
Christophe Lecoutre, Frédéric Bousse...