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:29 - 2 self

Documents Related by Co-Citation

282 and easy distributions of SAT problems – Hard - 1992
313 Boosting combinatorial search through randomization – Carla P. Gomes - 1998
112 Locating the Phase Transition in Binary Constraint Satisfaction Problems – B. M. Smith - 1994
117 Optimal Speedup of Las Vegas Algorithms – Michael Luby, Alistair Sinclair, David Zuckerman - 1993
679 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
575 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
360 Noise strategies for improving local search – Bart Selman, Henry A. Kautz, Bram Cohen - 1994
70 Problem Structure in the Presence of Perturbations – Carla P. Gomes, Bart Selman - 1997
183 Evidence for Invariants in Local Search – David McAllester, Bart Selman, Henry Kautz - 1997
136 Towards an understanding of hill-climbing procedures for SAT – Ian P. Gent, Toby Walsh Y - 1993
118 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
60 Stochastic local search - methods, models, applications – H H Hoos - 1998
97 Search in a Small World – Toby Walsh - 1998
42 Tuning Local Search for Satisfiability Testing – Andrew J. Parkes, Joachim P. Walser - 1996
737 A Machine program for theorem proving – G Logemann M Davis, D Loveland
103 Efficient local search for very large-scale satisfiability problems – J Gu - 1992