|
926
|
A computing procedure for quantification theory
– Martin Davis, Hilary Putnam
- 1960
|
|
100
|
Efficient local search for very large-scale satisfiability problem
– J Gu
- 1992
|
|
318
|
Noise strategies for improving local search
– Bart Selman, Henry A. Kautz, Bram Cohen
- 1994
|
|
620
|
A New Method for Solving Hard Satisfiability Problems
– Bart Selman, Hector Levesque, David Mitchell
- 1992
|
|
122
|
Towards an understanding of hill-climbing procedures for SAT
– Ian P. Gent, Toby Walsh Y
- 1993
|
|
90
|
Algorithms for the maximum satisfiability problem
– P Hansen, B Jaumard
- 1990
|
|
207
|
Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems
– Bart Selman, Henry Kautz
- 1993
|
|
17
|
Global Optimization for Satisfiability (SAT) Problem
– Jun Gu
- 1994
|
|
42
|
Computational experience with an interior point algorithm on the satisfiability problem
– A. P. Kamath, N. K. Karmarkar, K. G. Ramakrishnan
- 1990
|
|
178
|
The breakout method for escaping from local minima
– P Morris
- 1992
|
|
266
|
and Easy Distributions for SAT Problems
– Hard
- 1992
|
|
194
|
Hard and Easy Distributions of SAT Problems
– David Mitchell, Bart Selman, Hector Levesque
- 1992
|
|
90
|
On selecting a satisfying truth assignment
– C H Papadimitriou
- 1991
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
96
|
An Empirical Study of Greedy Local Search for Satisfiability Testing
– Bart Selman, Henry A. Kautz
- 1993
|
|
453
|
TABU SEARCH
– Fred Glover, Manuel Laguna
|
|
224
|
Local Search Strategies for Satisfiability Testing
– Bart Selman, Henry Kautz, Bram Cohen
- 1995
|
|
2802
|
Optimization by simulated annealing
– S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi
- 1983
|
|
362
|
Planning as satisfiability
– Henry Kautz, Bart Selman
- 1992
|
