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

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

Documents Related by Co-Citation

365 Noise strategies for improving local search – Bart Selman, Henry A. Kautz, Bram Cohen - 1994
685 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
528 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996
582 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
187 Evidence for Invariants in Local Search – David McAllester, Bart Selman, Henry Kautz - 1997
286 and easy distribution of sat problems – Hard - 1992
3655 Optimization by simulated annealing – S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi - 1983
621 Tabu Search – Fred Glover - 1989
968 Fast Planning Through Planning Graph Analysis – Avrim L. Blum, Merrick L. Furst - 1995