Towards an understanding of hill-climbing procedures for SAT (1993)

by Ian P. Gent , Toby Walsh Y
Venue:In Proceedings of AAAI-93
Citations:136 - 6 self

Documents Related by Co-Citation

361 Noise strategies for improving local search – Bart Selman, Henry A. Kautz, Bram Cohen - 1994
679 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
183 Evidence for Invariants in Local Search – David McAllester, Bart Selman, Henry Kautz - 1997
283 and easy distributions of sat problems – Hard - 1992
522 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996
577 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
103 Efficient local search for very large-scale satisfiability problems – J Gu - 1992
44 Unsatisfied variables in local search – Ian P. Gent, Toby Walsh - 1995
195 The Breakout Method for Escaping From Local Minima – P Morris - 1993
49 An Empirical Analysis of Search in GSAT – Ian Gent, Toby Walsh - 1993
199 Experimental Results on the Crossover Point in Satisfiability Problems – James M. Crawford, Larry D. Auton - 1993
73 Needed: An Empirical Science Of Algorithms – J.N. Hooker - 1994
88 On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT – Holger H. Hoos - 1999
217 Hard and Easy Distributions of SAT Problems – David Mitchell, Bart Selman, Hector Levesque - 1992
215 Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems – Bart Selman, Henry Kautz - 1993
3559 Optimization by simulated annealing – S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi - 1983
17 adding more constraints makes a problem easier for hill-climbing algorithms: Analysing landscapes of csp’s – Why - 1997
60 Stochastic local search - methods, models, applications – H H Hoos - 1998
99 An Empirical Study of Greedy Local Search for Satisfiability Testing – Bart Selman, Henry A. Kautz - 1993