|
266
|
and Easy Distributions for SAT Problems
– Hard
- 1992
|
|
86
|
Optimal Speedup of Las Vegas Algorithms
– Michael Luby, Alistair Sinclair, David Zuckerman
- 1993
|
|
620
|
A New Method for Solving Hard Satisfiability Problems
– Bart Selman, Hector Levesque, David Mitchell
- 1992
|
|
318
|
Noise strategies for improving local search
– Bart Selman, Henry A. Kautz, Bram Cohen
- 1994
|
|
269
|
Boosting combinatorial search through randomization
– Carla P. Gomes
- 1998
|
|
161
|
Evidence for Invariants in Local Search
– David Mcallester, Bart Selman, Henry Kautz
- 1997
|
|
122
|
Towards an understanding of hill-climbing procedures for SAT
– Ian P. Gent, Toby Walsh Y
- 1993
|
|
105
|
Testing Heuristics: We Have It All Wrong
– J.N. Hooker
- 1995
|
|
49
|
Evaluating Las Vegas algorithms -- pitfalls and remedies
– Holger H. Hoos, Thomas Stützle
- 1998
|
|
47
|
An Empirical Analysis of Search in GSAT
– Ian Gent, Toby Walsh
- 1993
|
|
18
|
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
– H. Alt, L. Guibas, K. Mehlhorn, R. Karp, A. Wigderson
- 1996
|
|
104
|
Locating the Phase Transition in Binary Constraint Satisfaction Problems
– B. M. Smith
- 1994
|
|
55
|
Stochastic Local Search - Methods, Models, Applications
– H Hoos
- 1998
|
|
100
|
Efficient local search for very large-scale satisfiability problem
– J Gu
- 1992
|
|
501
|
Where the really hard problems are
– Peter Cheeseman, Bob Kanefsky, William M. Taylor
- 1991
|
|
22
|
Characterizing the Run-time Behavior of Stochastic Local Search
– Holger H. Hoos, Thomas Stützle
- 1998
|
|
57
|
An Introduction to Probability Theory and Mathematical Statistics
– V K Rohatgi
- 1976
|
|
67
|
Needed: An Empirical Science Of Algorithms
– J.N. Hooker
- 1994
|
|
178
|
The breakout method for escaping from local minima
– P Morris
- 1992
|
