Variable Dependency in Local Search: Prevention Is Better Than Cure
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 107-120
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A Stochastic Non-CNF SAT SolverLecture Notes in Computer Science, 2006
- Symmetry Breaking and Local Search SpacesLecture Notes in Computer Science, 2005
- Negative Effects of Modeling Techniques on Search PerformanceAnnals of Operations Research, 2003
- Efficient CNF Encoding of Boolean Cardinality Constraints2003
- Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT2002
- Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination2001
- The Taming of the (X)ORLecture Notes in Computer Science, 2000
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problemsArtificial Intelligence, 1992
- On the parallel complexity of discrete relaxation in constraint satisfaction networksArtificial Intelligence, 1990
- Strips: A new approach to the application of theorem proving to problem solvingArtificial Intelligence, 1971