On the quality and quantity of random decisions in stochastic local search for SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4013 LNAI, Issue , 2006, Pages 146-158

  Tompkins, Dave A D ^a   Hoos, Holger H ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; DECISION MAKING; NUMBER THEORY; PROBLEM SOLVING; QUALITY OF SERVICE; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS);

DETRIMENTAL EFFECTS; PAPADIMITRIOU ALGORITHM; RANDOM DECISIONS; STOCHASTIC LOCAL SEARCH (SLS);

STOCHASTIC CONTROL SYSTEMS;

EID: 33746084022     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11766247_13     Document Type: Conference Paper

References (23)

1. Hoos, H.H., Stützte, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann (2004)
2. Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: Proc. of the 32nd Symp. on Foundations of Computer Science. (1991) 163-169
3. Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proc. of the 12th Nat'1 Conf. on Artificial Intelligence (AAAI94). (1994) 337-343
4. Schöning, U.: A probabilistic algorithm for fc-SAT and constraint satisfaction problems. In: Proc. of the 40th Symp. on Foundations of Computer Science. (1999) 410-414
5. Hutter, F., Tompkins, D.A., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Proceedings of CP-02. (2002) 233-248
6. Éric D. Taillard: Robust taboo search for the quadratic assignment problem. Parallel Computing 17 (1991) 443-455
7. Gent, I.P., Walsh, T.: Towards an understanding of hillclimbing procedures for SAT. In: Proc. of the 11th Nat'1 Conf. on Artificial Intelligence (AAAI93). (1993) 28-33
8. Ferrenberg, A.M., Landau, D.P., Wong, Y.J.: Monte Carlo simulations: Hidden errors from "good" random number generators. Physical Review Letters 69 (1992) 3382-3384
9. Bauke, H., Mertens, S.: Pseudo random coins show more heads than tails. Journal of Statistical Physics 114 (2004) 1149-1169
10. Ribeiro, C.C., Souza, R.C., Vieira, C.E.C.: A comparative computational study of random number generators. Pacific Journal of Optimization 1 (2005) 565-578
11. Tompkins, D.A.D., Hoos, H.H.: Warped landscapes and random acts of SAT solving. In: Proc. of the 8th Symp. on Artificial Intelligence and Mathematics. (2004)
12. Iwama, K.,Tamaki,S.: Improved upper bounds for 3-SAT. In: Proc. of the 15th ACM-SIAM Symp. on Discrete algorithms (SODA 04). (2004) 328-328
13. Parkes, A.J., Waiser, J.P.: Tuning local search for satisfiability testing. In: Proc. of the 13th Nat'1 Conf. on Artificial Intelligence (AAAI 96). (1996) 356-362
14. Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proc. of the 18th Nat'l Conf. on Artificial Intelligence (AAAI 02). (2002) 655-660
15. Le Berre, D., Simon, L.: 55 solvers in Vancouver: The SAT 2004 competition. In: Proc. of 7th Conf. on Theory & Applications of Satisfiability Testing (SAT 04). (2005) 321-345
16. Tompkins, D.A.D., Hoos, H.H.: UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: Proc. of (SAT 04). (2005) 305-320
17. Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Modeling & Comp. Simulation 8 (1998) 3-30
18. Hoos, H.H., Stutzle, T.: SATLIB: An online resource for research on SAT. In: SAT2000: Highlights of Satisfiability Research in the year 2000. (2000) 283-292
19. Bagini, V., Bucci, M.: A design of reliable true random number generator for cryptographic applications. In: Workshop Cryptographic Hardware & Embedded Syst. (1999) 204-218
20. Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. Technical Report 800-22, MIST (2000)
21. Knuth, D.E.: The Art of Computer Programming, Volume 2. Addison-Wesley (1969)
22. Schuurmans, D., Southey, F., Holte, R.C.: The exponentiated subgradient algorithm for heuristic boolean programming. In: Proc. of (IJCAI01). (2001) 334-341
23. Dantsin, E., Goerdt, A., Hirsch, E.A., Schöning, U.: Deterministic algorithms for fc-SAT based on covering codes & local search. In: Automata, Languages & Prog. (2000) 236-247