An analysis of phase transition in NK landscapes

Journal of Artificial Intelligence Research

Volumn 17, Issue , 2002, Pages 309-332

  Gao, Yong ^a   Culberson, Joseph ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; OPTIMIZATION; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

GENETIC OPERATORS; LANDSCAPES; RANDOM DISTRIBUTIONS; RANDOM MODELS;

RANDOM PROCESSES;

EID: 10244279314     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.1081     Document Type: Article

References (29)

1. Achlioptas, D. (1999). Threshold Phenomena in Random Graph Colouring and Satisfiability. Ph.D. thesis, Department of Computer Science, University of Toronto, Toronton, Canada.
2. Achlioptas, D. (2001). A survey of lower bounds for random 3-sat via differential equations. Theoretical Computer Science, 265, 159-185.
3. Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., & Molloy, M. (1997). Random constraint satisfaction: A more accurate picture. In Proceedings of CP97, pp. 107-120. Springer.
4. Alon, N., & Spencer, J. (1992). The Probabilistic Method. Wiley, New York.
5. Altenberg, L. (1997). Nk fitness landscapes. In Back, T., Fogel, D., & Michalewicz, Z. (Eds.), Handbook of Evolutionary Computation. Oxford University Press, New York.
6. Cheeseman, P., Kanefsky, B., & Taylor, W. (1991). Where the really hard problems are. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp. 331-337. Morgan Kaufmann.
7. Cook, S., & Mitchell, D. (1997). Finding hard instances of the satisfiability problem: A survey. In Du, Gu, & Pardalos (Eds.), Satisfiability Problem: Theory and Applications, Vol. 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society.
8. Culberson, J., & Gent, I. (2001). Frozen development in graph coloring. Theoretical Computer Science, 265(1-2), 227-264.
9. Dubois, O. (2001). Upper bounds on the satisfiability threshold. Theoretical Computer Science, 265(1-2), 187-197.
10. Franco, J., & Gelder, A. (1998). A perspective on certain polynomial time solvable classes of satisfiability. Discrete Applied Mathematics, to appear.
11. Franco, J., & Paul, M. (1983). Probabilistic analysis of the davis-putnam procedure for solving satisfiability. Discrete Applied Mathematics, 5, 77-87.
12. Freeman, J. (1996). Hard random 3-sat problems and the davis-putman procedure. Artificial Intelligence, 81, 183-198.
13. Friedgut, E. (1999). Sharp thresholds of graph properties and the k-sat problem. J. Amer. Math. Soc., 1017-1054.
14. Friedgut, E., & Kalai, G. (1996). Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc., 2993-3002.
15. Frieze, A., & Suen, S. (1996). Analysis of two simple heuristics on a random instance of k-sat. J. of Algorithm, 20(2), 312-355.
16. Gao, Y. (2001). Threshold phenomena in NK landscapes. Master's thesis, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada.
17. Gent, I., MacIntyre, I., Prosser, P. and Smith, B., & Walsh, T. (1998). Random constraint satisfaction: Flaws and structure. Tech. rep. APES-08-1998, APES Research Group.
18. Heckendorn, R., Rana, S., & Whitley, D. (1999). Polynomial time summary statistics for a generalization of maxsat. In GECCO99: Proceedings of the Genetic and Evolutinary Computation Conference, pp. 281-288. Morgan Kaufmann.
19. Hordijk, W. (1997). A measure of landscapes. Evolutionary Computation, (4), 335-360.
20. Jones, T. (1995). Evolutionary Algorithms, Fitness Landscapes and Search. Ph.D. thesis, University of New Mexico, Albuquerque, NM.
21. Kauffman, S. (1989). Adaptation on rugged fitness landscapes. In Stein, D. (Ed.), Lectures in the Sciences of Complexity, Santa Fe Institute Studies in the Sciences of Complexity, pp. 527-618. Addison Wesley.
22. Kauffman, S. (1993). The Origins of Order: Self-organization and Selection in Evolution. Oxford University Press, Inc.
23. Kirkpatrick, S., & Selman, B. (1994). Critical behavior in the satisfiability of random boolean expressions. Science, 264, 1297-1301.
24. Kirousis, L., P.Kranakis, D.Krizanc, & Y.Stamation (1994). Approximating the unsatisfiability threshold of random formulas. Random Structures and Algorithms, 12(3), 253-269.
25. Larranaga, P., & Lozano, J. (2001). Estimation of Distribution Algorithms: A New Tool for Evolutinary Computation. Kluwer Academic Publishers, New York.
26. Mitchell, D., Selman, B., & Levesque, H. (1992). Hard and easy distributions of sat problems. In Proceedings of the 10th Natl. Conf on Artificial Intelligence, pp. 459-465. AAAI Press.
27. n,m phase transition is not hard for the Hamiltonian Cycle problem. Journal of Artificial Intelligence Research, 9, 219-245.
28. Weinberger, E. D. (1996). Np completeness of kauffman's NK model, a tunable rugged fitness landscape. Tech. rep. 96-02-003, Santa Fe Institute, Santa Fe.
29. Wright, A. H., Thompson, R. K., & Zhang, J. (2000). The computational complexity of NK fitness functions. IEEE Transactions on Evolutionary Computation, 4(4), 373-379.