Tree clustering for constraint networks (research note)
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Optimal speedup of Las Vegas algorithms
Information Processing Letters
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
The complexity of constraint satisfaction revisited
Artificial intelligence in perspective
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Compiling constraint satisfaction problems
Artificial Intelligence
Radio Link Frequency Assignment
Constraints
The Brélaz Heuristic and Optimal Static Orderings
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Variable neighborhood search for the maximum clique
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Finding Crucial Subproblems to Focus Global Search
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Extracting MUCs from Constraint Networks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Tradeoffs in the complexity of backdoor detection
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Efficient recognition of acyclic clustered constraint satisfaction problems
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Typed guarded decompositions for constraint satisfaction
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
The hybrid search algorithm for constraint satisfaction problems described here first uses local search to detect crucial substructures and then applies that knowledge to solve the problem. This paper shows the difficulties encountered by traditional and state-of-the-art learning heuristics when these substructures are overlooked. It introduces a new algorithm, Foretell, to detect dense and tight substructures called clusters with local search. It also develops two ways to use clusters during global search: one supports variable-ordering heuristics and the other makes inferences adapted to them. Together they improve performance on both benchmark and real-world problems.