Local Search for Very Large SAT Problems
暂无分享,去创建一个
[1] Andrew J. Parkes,et al. Tuning Local Search for Satisfiability Testing , 1996, AAAI/IAAI, Vol. 1.
[2] Toby Walsh,et al. Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.
[3] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[4] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[5] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[7] Uwe Schöning. A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems , 1999, FOCS.
[8] Toby Walsh,et al. SCHOOL OF COMPUTER STUDIES Modelling the Golomb Ruler Problem 1 Introduction 2 The problem , 1999 .
[9] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[10] Benjamin W. Wah,et al. A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..
[11] Joseph Culbersony,et al. On the Probabilistic Approximate Completeness of WalkSAT for 2-SAT , 2000 .
[12] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[13] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[14] Toby Walsh,et al. Modelling the Golomb Ruler Problem , 1999 .
[15] Holger H. Hoos,et al. On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.
[16] Alan K. Mackworth. On Reading Sketch Maps , 1977, IJCAI.
[17] Dale Schuurmans,et al. Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..
[18] C.H. Papadimitriou,et al. On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.