Sciweavers

400 search results - page 39 / 80
» Backtracking
Sort
View
CPAIOR
2005
Springer
14 years 4 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 4 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
AI
2004
Springer
14 years 4 months ago
A Hybrid Schema for Systematic Local Search
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
William S. Havens, Bistra N. Dilkina
CP
2004
Springer
14 years 4 months ago
The Tractability of Global Constraints
Abstract. Constraint propagation is one of the techniques central to the success of constraint programming. Fast algorithms are used to prune the search space either before or duri...
Christian Bessière, Emmanuel Hebrard, Brahi...
CP
2004
Springer
14 years 4 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate