Random walk with continuously smoothed variable weights

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 203-215

  Prestwich, Steven ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

LOCAL MINIMA; RANDOM WALK ALGORITHMS; WEIGHT SMOOTH TECHNIQUE;

ALGORITHMS;

EID: 26444472414     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_15     Document Type: Conference Paper

References (35)

1. Y. Asahiro, K. Iwama, E. Miyano. Random Generation of Test Instances with Controlled Attributes. In D. S. Johnson, M. A. Trick (eds), Cliques, Coloring and Satisfiability: Second Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26, American Mathematical Society 1996, pp. 127-154.
2. B. Cha, K. Iwama. Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann 1995, pp. 304-310.
3. J. Culberson, I. P. Gent, H. H. Hoos. On the Probabilistic Approximate Completeness of WalkSAT for 2-SAT. Technical Report APES-15a-2000, APES Research Group, 2000.
4. J. Frank. Weighting for GODOT: Learning Heuristics for GSAT. Proceedings of the Thirteenth National Conference on Artificial Intelligence, MIT Press, 1996, pp. 338-343.
5. J. Frank. Learning Short-Term Weights for GSAT. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, 1997, pp. 384-389.
6. A. S. Fukunaga. Variable-Selection Heuristics in Local Search for SAT. Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997, pp. 275-280.
7. I. P. Gent, T. Walsh. Towards an Understanding of Hill-Climbing Procedures for SAT. Proceedings of the Eleventh National Conference on Artificial Intelligence, AAAI Press, 1993, pp. 28-33.
8. I. P. Gent, T. Walsh. Unsatisfied Variables in Local Search. J. Hallam (ed.), Hybrid Problems, Hybrid Solutions, IOS Press, Amsterdam, The Netherlands, 1995, pp. 73-85.
9. M. L. Ginsberg, A. J. Parkes. Satisfiability Algorithms and Finite Quantification. Seventh International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, 2000, pp. 690-701.
10. J. Gu. Efficient Local Search for Very Large-Scale Satisfiability Problems. Sigart Bulletin vol. 3, no. 1, 1992, pp. 8-12.
11. E. A. Hirsch, A. Kojevnikov. Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. Seventh International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 2239, Springer, 2001, pp. 605-609.
12. H. H. Hoos. On the Run-Time Behaviour of Stochastic Local Search Algorithms. Sixteenth National Conference on Artificial Intelligence, AAAI Press, 1999, pp. 661-666.
13. W. Huang, D. Zhang, H. Wang. An Algorithm Based on Tabu Search for Satisfiability Problem. Journal of Computer Science and Technology vol. 17 no. 3, Editorial Universitaria de Buenos Aires, 2002, pp. 340-346.
14. F. Hutter, D. A. D. Tompkins, H. H. Hoos. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. Eighth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 2470, Springer, 2002, pp. 233-248.
15. B. Mazure, L. Saïs, É. Grégoire. Tabu Search for SAT. Proceedings of the Fourteenth National Conference on Artificial Intelligence, 1997, pp. 281-285.
16. B. Mazure, L. Saïs, É. Grégoire. Boosting Complete Techniques Thanks to Local Search. Annals of Mathematics and Artificial Intelligence vol. 22, 1998, pp. 309-322.
17. D. A. McAllester, B. Selman, H. A. Kautz. Evidence for Invariants in Local Search. Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, AAAI Press / MIT Press 1997, pp. 321-326.
18. P. Mills, E. P. K. Tsang. Guided Local Search for Solving SAT and Weighted MAX-SAT Problems. Journal of Automated Reasoning, Special Issue on Satisfiability Problems, Kluwer, Vol.24, 2000, pp. 205-223.
19. P. Morris. The Breakout Method for Escaping from Local Minima. Proceedings of the Eleventh National Conference on Artificial Intelligence, AAAI Press / MIT Press, 1993, pp. 40-45.
20. S. D. Prestwich. Incomplete Dynamic Backtracking for Linear Pseudo-Boolean Problems. Annals of Operations Research vol. 130, 2004, pp. 57-73.
21. S. D. Prestwich. SAT Problems With Chains of Dependent Variables. Discrete Applied Mathematics vol. 3037, Elsevier, 2002, pp. 1-22.
22. D. Schuurmans, F. Southey, R. C. Holte. The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, 2001, pp. 334-341.
23. D. Schuurmans, F. Southey. Local Search Characteristics of Incomplete SAT Procedures. Proceedings of the Seventeenth National Conference on Artificial Intelligence, AAAI Press, 2000, pp. 297-302.
24. B. Selman, H. A. Kautz. Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993, pp. 290-295.
25. B. Selman, H. A. Kautz, B. Cohen. Noise Strategies for Improving Local Search. Proceedings of the Twelfth National Conference on Artificial Intelligence, AAAI Press, 1994, pp. 337-343.
26. B. Selman, H. Levesque, D. Mitchell. A New Method for Solving Hard Satisfiability Problems. Proceedings of the Tenth National Conference on Artificial Intelligence, MIT Press, 1992, pp. 440-446.
27. K. Smyth, H. H. Hoos, T. Stützle. Iterated Robust Tabu Search for MAX-SAT. Proceedings of the Sixteenth Canadian Conference on Artificial Intelligence, Lecture Notes in Computer Science vol. 2671, Springer Verlag, 2003, pp. 129-144.
28. J. R. Thornton, W. Pullan, J. Terry. Towards Fewer Parameters for Clause Weighting SAT Algorithms. Proceedings of the Fifteenth Australian Joint Conference on Artificial Intelligence, Lecture Notes in Artificial Intelligence vol. 2557, Springer-Verlag, 2002, pp. 569-578.
29. J. R. Thornton, D. N. Pham, S. Bain, V. Ferreira Jr. Additive versus Multiplicative Clause Weighting for SAT. Proceedings of the Nineteenth National Conference on Artificial Intelligence, San Jose, California, 2004, pp. 191-196.
30. D. A. D. Tompkins, H. H. Hoos. UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing, 2004, pp. 37-46.
31. D. A. D. Tompkins, H. H. Hoos. Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT. Proceedings of the Sixteenth Canadian Conference on Artificial Intelligence, Lecture Notes in Computer Science vol. 2671, Springer, 2003, pp. 145-159.
32. D. A. D. Tompkins, H. H. Hoos. Warped Landscapes and Random Acts of SAT Solving. Proceedings of the Eighth International Symposium on Artificial Intelligence and Mathematics, 2004 (to appear).
33. W. Wei, B. Selman. Accelerating Random Walks. Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 2470, Springer, 2002, pp. 216-232.
34. Z. Wu, B. W. Wah. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems. Proceedings of the Seventeenth National Conference on Artificial Intelligence, AAAI Press, 2000, pp. 310-315.
35. W. Zhang, A. Rangan, M. Looks. Backbone Guided Local Search for Maximum Satisfiability. Eighteenth International Joint Conference on Artificial Intelligence, 2003, pp. 1179-1186.