A polynomial time computation of the exact correlation structure of k-satisfiability landscapes

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 365-372

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

^a Colorado State University   (United States)

Author keywords

Combinatorial optimization; Fitness landscapes

Indexed keywords

AUTOCORRELATION FUNCTIONS; CORRELATION LENGTHS; CORRELATION STRUCTURE; EVALUATION FUNCTION; FITNESS LANDSCAPE; FITNESS LANDSCAPES; HEURISTIC SEARCH ALGORITHMS; K-SATISFIABILITY; LOCAL SEARCH; POLYNOMIAL-TIME; POLYNOMIAL-TIME COMPUTATION; RANDOM WALK; STATISTICAL QUANTITY;

COMBINATORIAL OPTIMIZATION; CORRELATION DETECTORS; HEALTH; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; POLYNOMIAL APPROXIMATION; REGRESSION ANALYSIS; SOIL STRUCTURE INTERACTIONS;

CORRELATION METHODS;

EID: 72749093323     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569952     Document Type: Conference Paper

References (21)

1. E. Angel and V. Zissimopoulos. On the classification of NP-complete problems in terms of their correlation coefficient. Discrete Applied Mathematics, 99:261-277, 2000.
2. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the Really Hard Problems Are. In Proc. of IJCAI-1991 Sydney, Australia, pages 331-337, 1991.
3. D. A. Clark, J. Frank, I. P. Gent, E. MacIntyre, N. Tomov, and T. Walsh. Local search and the number of solutions. In CP-1996, pages 119-133, 1996.
4. M. Eigen, J. McCaskill, and P. Schuster. Molecular quasispecies. J. of Physical Chemistry, 92(24):6881-6891, Dec 1988.
5. A. K. Hartmann and M. Weigt. Phase Transitions in Combinatorial Optimization Problems. Wiley-VCH, 2005.
6. H. H. Hoos, K. Smyth, and T. Stützle. Search space features underlying the performance of stochastic local search algorithms for MAX-SAT. In Proc. of PPSN-8, pages 51-60, Sept. 2004. Springer.
7. W. Hordijk and P. F. Stadler. Amplitude spectra of fitness landscapes. J. of Complex Systems, 1:39-66, 1998.
8. S. Kirkpatrick and B. Selman. Critical behavior in the satisfiability of random boolean expressions. Science, 264:1297-1301, 1994.
9. P. Merz and B. Freisleben. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE-EC, 4(4):337-352, November 2000.
10. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of SAT problems. In Proc. of AAAI-1992, 1992.
11. A. J. Parkes. Clustering at the phase transition. In Proc. of AAAI-1997, 1997.
12. S. Rana, R. B. Heckendorn, and L. D. Whitley. A tractable Walsh analysis of SAT and its implications for genetic algorithms. In Proc. of AAAI-1998, pages 392-397, 1998.
13. J. Singer, I. P. Gent, and A. Smaill. Backbone fragility causes the local search cost peak. JAIR, 12:235-270, 2000.
14. P. F. Stadler. Toward a theory of landscapes. In R. Lopéz- Peña, R. Capovilla, R. García-Pelayo, H. Waelbroeck, and F. Zertruche, editors, Complex Systems and Binary Networks, pages 77-163. Springer Verlag, 1995.
15. P. F. Stadler. Landscapes and their correlation functions. J. of Mathematical Chemistry, 20:1-45, 1996.
16. P. F. Stadler and R. Happel. Random field models for fitness landscapes. J. of Mathematical Biology, 38(5):435-478, 1999.
17. P. F. Stadler and W. Schnabl. The landscape of the traveling salesman problem. Physics Letters A, 161:337-344, 1992.
18. E. D. Weinberger. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63:325-336, 1990.
19. C. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.
20. L. Xu, H. H. Hoos, and K. Leyton-Brown. Hierarchical hardness models for SAT. In In CP-2007, pages 696-711, 2007.
21. M. Yokoo. Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs. In CP-1997, pages 356-370, 1997.