Directed plateau search for MAX-k-SAT

Proceedings of the 3rd Annual Symposium on Combinatorial Search, SoCS 2010

Volumn , Issue , 2010, Pages 90-97

  Sutton, Andrew M ^a   Howe, Adele E ^a   Whitley, L Darrell ^a  

^a Department of Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECT SEARCH; FORMAL ANALYSIS; GRADIENT COMPUTATION; HILL CLIMBING; LARGE REGIONS; LOCAL SEARCH ALGORITHM; OBJECTIVE FUNCTIONS; SEARCH SPACES;

RANDOM PROCESSES;

ALGORITHMS;

EID: 84865749563     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Frank, J.; Cheeseman, P.; and Stutz, J. 1997. When gravity fails: Local search topology. JAIR 7:249-281.
2. Gent, I. P., and Walsh, T. 1993. An empirical analysis of search in GSAT. JAIR 1:47-59.
3. Hampson, S., and Kibler, D. 1993. Plateaus and plateau search in Boolean satisfiability problems: When to give up searching and start again. DIMACS Series in Discrete Math and Theoretical Computer Science 26:437-453.
4. Heras, F.; Larrosa, J.; and Oliveras, A. 2008. MiniMaxSat: an efficient weighted Max-SAT solver. JAIR 31:1-32.
5. Hoos, H. 1999. On the run-time behaviour of stochastic local search algorithms for SAT. In Proc. of AAAI'99, 661-666.
6. Kroc, L.; Sabharwal, A.; Gomes, C.; and Selman, B. 2009. Integrating systematic and local search paradigms: A new strategy for maxSAT. In Proc. of IJCAI'09.
7. Li, C. M., and Huang, W. Q. 2005. Diversification and determinism in local search for satisfiability. In Proc. SAT-05, volume 3569 of LNCS, 158-172.
8. Li, C.; Wei, W.; and Zhang, H. 2007. Combining adaptive noise and look-ahead in local search for SAT. LNCS 4501:121-133.
9. Mastrolilli, M., and Gambardella, L. M. 2005. How good are tabu search and plateau moves in the worst case? Eur J Oper Res 166:63-76.
10. McAllester, D.; Selman, B.; and Kautz, H. 1997. Evidence for invariants in local search. In Proc. of AAAI'97.
11. Rana, S.; Heckendorn, R. B.; and Whitley, L. D. 1998. A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proc. of AAAI'98, 392-397.
12. Selman, B., and Kautz, H. A. 1993. Domain-independent extensions to GSAT: Solving large structured variables. In Proc. of IJCAI'93, 290-295.
13. Selman, B.; Kautz, H. A.; and Cohen, B. 1994. Noise strategies for improving local search. In Proc. of AAAI'94, 337-343.
14. Selman, B.; Kautz, H.; and Cohen, B. 1996. Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26.
15. Selman, B.; Levesque, H.; and Mitchell, D. 1992. A new method for solving hard satisfiability problems. In Proc. of AAAI'92.
16. Smyth, K. R. G. 2004. Understanding stochastic local search algorithms: An empirical analysis of the relationship between search space structure and algorithm behaviour. Master's thesis, University of British Columbia.
17. Sutton, A. M.; Whitley, L. D.; and Howe, A. E. 2010. Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time. Technical Report CS-10-104, Colorado State University. http://www.cs.colostate.edu/ TechReports/Reports/2010/tr10-104.pdf