Simulated annealing: theory and applications
Simulated annealing: theory and applications
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
On the greedy algorithm for satisfiability
Information Processing Letters
EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS
EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS
Experimental analysis of algorithms
Experimental analysis of algorithms
The constrainedness knife-edge
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Which search problems are random?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Heuristics for Improving the Non-oblivious Local Search for MaxSAT
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
ACM Transactions on Internet Technology (TOIT)
Hard Problem Generation for MKP
ENC '05 Proceedings of the Sixth Mexican International Conference on Computer Science
Tackling car sequencing problems using a generic genetic algorithm
Evolutionary Computation
A multilevel tabu search algorithm for the feature selection problem in biomedical data
Computers & Mathematics with Applications
Tuning Local Search by Average-Reward Reinforcement Learning
Learning and Intelligent Optimization
A Theoretical Analysis of Search in GSAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Variable-selection heuristics in local search for SAT
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Evaluating las vegas algorithms: pitfalls and remedies
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Model complexity vs. performance in the bayesian optimization algorithm
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Hi-index | 0.00 |
We describe an extensive study of search in GSAT, an approximation procedure for propositional satisfiability. GSAT performs greedy hill-climbing on the number of satisfied clauses in a truth assignment. Our experiments provide a more complete picture of GSAT's search than previous accounts. We describe in detail the two phases of search: rapid hill-climbing followed by a long plateau search. We demonstrate that when applied to randomly generated 3-SAT problems, there is a very simple scaling with problem size for both the mean number of satisfied clauses and the mean branching rate. Our results allow us to make detailed numerical conjectures about the length of the hill-climbing phase, the average gradient of this phase, and to conjecture that both the average score and average branching rate decay exponentially during plateau search. We end by showing how these results can be used to direct future theoretical analysis. This work provides a case study of how computer experiments can be used to improve understanding of the theoretical properties of algorithms.