On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT (1999)

by Holger H. Hoos
Citations:88 - 21 self

Documents Related by Co-Citation

361 Noise strategies for improving local search – Bart Selman, Henry A. Kautz, Bram Cohen - 1994
183 Evidence for Invariants in Local Search – David McAllester, Bart Selman, Henry Kautz - 1997
680 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
136 Towards an understanding of hill-climbing procedures for SAT – Ian P. Gent, Toby Walsh Y - 1993
194 The breakout method for escaping from local minima – P Morris - 1993
87 Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT – Frank Hutter, Dave A. D. Tompkins, Holger H. Hoos - 2002
59 Local search characteristics of incomplete SAT procedures – Dale Schuurmans, Finnegan Southey - 2000
44 The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming – Dale Schuurmans, Finnegan Southey, Robert C. Holte - 2001
60 Stochastic local search - methods, models, applications – H H Hoos - 1998
521 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search – Henry Kautz, Bart Selman - 1996
215 Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems – Bart Selman, Henry Kautz - 1993
283 and easy distributions of sat problems – Hard - 1992
62 Local search algorithms for SAT: An empirical evaluation – Holger H. Hoos, Thomas Stützle - 2000
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
65 When Gravity Fails: Local Search Topology – Jeremy D. Frank, Peter Cheeseman, John Stutz - 1997
11 Learning short-term clause weights for GSAT – J Frank - 1997
106 Algorithms for the maximum satisfiability problem – P Hansen, B Jaumard - 1990
51 Evaluating Las Vegas algorithms -- pitfalls and remedies – Holger H. Hoos, Thomas Stützle - 1998