Sciweavers

ANOR
2004
116views more  ANOR 2004»
13 years 3 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
AAAI
1996
13 years 5 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
MTV
2003
IEEE
126views Hardware» more  MTV 2003»
13 years 9 months ago
Heuristic Backtracking Algorithms for SAT
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of f...
Ateet Bhalla, Inês Lynce, José T. de ...
CP
2004
Springer
13 years 9 months ago
Statistical Regimes Across Constrainedness Regions
Abstract. Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of ...
Carla P. Gomes, Cèsar Fernández, Bar...
CP
2005
Springer
13 years 9 months ago
Search Heuristics and Heavy-Tailed Behaviour
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...
Tudor Hulubei, Barry O'Sullivan