Summarizing CSP hardness with continuous probability distributions (1997)

Cached

Download Links

by Daniel Frost , Irina Rish , Lluis Vila
Venue:In Proceedings of the 14th National Conference on AI
Citations:30 - 2 self

Documents Related by Co-Citation

283 and easy distributions of sat problems – Hard - 1992
315 Boosting combinatorial search through randomization – Carla P. Gomes - 1998
118 Optimal Speedup of Las Vegas Algorithms – Michael Luby, Alistair Sinclair, David Zuckerman - 1993
683 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
360 Noise strategies for improving local search – Bart Selman, Henry A. Kautz, Bram Cohen - 1994
576 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
112 Locating the Phase Transition in Binary Constraint Satisfaction Problems – B. M. Smith - 1994
183 Evidence for Invariants in Local Search – David McAllester, Bart Selman, Henry Kautz - 1997
137 Towards an understanding of hill-climbing procedures for SAT – Ian P. Gent, Toby Walsh Y - 1993
119 Testing Heuristics: We Have It All Wrong – J.N. Hooker - 1995
51 Evaluating Las Vegas algorithms -- pitfalls and remedies – Holger H. Hoos, Thomas Stützle - 1998
49 An Empirical Analysis of Search in GSAT – Ian Gent, Toby Walsh - 1993
19 A method for obtaining randomized algorithms with small tail probabilities’, Algorithmica – H. Alt, L. Guibas, K. Mehlhorn, R. Karp, A. Wigderson - 1996
72 Problem Structure in the Presence of Perturbations – Carla P. Gomes, Bart Selman - 1997
60 Stochastic local search - methods, models, applications – H H Hoos - 1998
98 Search in a Small World – Toby Walsh - 1998
89 On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT – Holger H. Hoos - 1999
43 Tuning Local Search for Satisfiability Testing – Andrew J. Parkes, Joachim P. Walser - 1996
742 A machine program for theorem proving – Martin Davis, George Logemann, Donald Loveland - 1962