Unsatisfied Variables in Local Search (1995)

by Ian P. Gent , Toby Walsh
Venue:Hybrid Problems, Hybrid Solutions. IOS
Citations:44 - 2 self

Documents Related by Co-Citation

360 Noise strategies for improving local search – Bart Selman, Henry A. Kautz, Bram Cohen - 1994
683 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
137 Towards an understanding of hill-climbing procedures for SAT – Ian P. Gent, Toby Walsh Y - 1993
183 Evidence for Invariants in Local Search – David McAllester, Bart Selman, Henry Kautz - 1997
576 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
283 and easy distributions of sat problems – Hard - 1992
30 Weighting for Godot: Learning Heuristics for GSAT – Jeremy Frank - 1996
49 An Empirical Analysis of Search in GSAT – Ian Gent, Toby Walsh - 1993
521 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996
197 The Breakout Method for Escaping From Local Minima – P Morris - 1993
46 Adding New Clauses for Faster Local Search – Byungki Cha, Kazuo Iwama - 1996
104 Efficient local search for very large-scale satisfiability problem – J Gu - 1992
99 An Empirical Study of Greedy Local Search for Satisfiability Testing – Bart Selman, Henry A. Kautz - 1993
37 Performance tests of local search algorithms using new types of random cnf formulas – Byungki Cha, Kazuo Iwama - 1995
22 Plateaus and Plateau Search in Boolean Satisfiability Problems: When to Give Up Searching and Start Again – Steven Hampson, Dennis Kibler - 1993
44 Simulated Annealing for Hard Satisfiability Problems – William M. Spears - 1993
45 A new method to solve hard satis problems – Bart Selman, Hector Levesque, David Mitchell - 1992
19 der Hauw. Solving 3-SAT with Adaptive Genetic Algorithms – A E Eiben, J K Van - 1997
89 On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT – Holger H. Hoos - 1999