Embedded landscapes

Evolutionary Computation

Volumn 10, Issue 4, 2002, Pages 345-369

  Heckendorn, Robert B ^a  

^a University of Idaho   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER ANALYSIS; EVOLUTION; MATHEMATICS; THEORETICAL MODEL;

ALGORITHMS; COMPUTING METHODOLOGIES; EVOLUTION; MATHEMATICS; MODELS, THEORETICAL;

EID: 0036886216     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/106365602760972758     Document Type: Article

References (27)

1. Altenberg, L. (1994). Evolving better representations through selective genome growth. In Proceedings of the IEEE World Congress on Computational Intelligence, pages 182-187, IEEE Press, Piscataway, New Jersey.
2. Altenberg, L. (1996). Nk fitness landscapes. In Back, T., Fogel, D., and Michalewicz, Z., editors, The Handbook of Evolutionary Computation, Oxford University Press, Oxford, UK.
3. Bethke, A. D. (1981). Genetic Algorithms as function Optimizers. Ph.D. thesis, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor, Michigan.
4. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1990). Introduction to Algorithms. McGraw-Hill, New York, New York.
5. Goldberg, D. (1989a). Genetic algorithms and walsh functions: Part i, a gentle introduction. Complex Systems, 3:129-152.
6. Goldberg, D. (1989b). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading, Massachusetts.
7. Heckendorn, R. B. and Whitley, D. (1997). A walsh analysis of nk-landscapes In Bäck, T., editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 41-48, Morgan Kaufmann, San Francisco, California.
8. Heckendorn, R. B. and Whitley, D. (1999). Predicting epistasis from mathematical models. Evolutionary Computation, 7(1):69-101.
9. Heckendorn, R. B., Rana, S., and Whitley, D. (1999a). Polynomial time summary statistics for a generalization of maxsat. In Banzhaf, W. et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 281-288, Morgan Kaufmann, San Francisco, California.
10. Heckendorn, R. B., Rana, S., and Whitley, D. (1999b). Test function generators as embedded landscapes. In Bäck, T. and Banzhaf, W., editors, Foundations of Genetic Algorithms - 5, pages 183-198, Morgan Kaufmann, San Francisco, California.
11. Heckendorn, R. B., Whitley, L. D., and Rana, S. (1997). Nonlinearity, hyperplane ranking and the simple genetic algorithm. In Belew, R. K. and Vose, M., editors, Foundations of Genetic Algorithms - 4, pages 181-202, Morgan Kaufmann, San Francisco, California.
12. Hogg, T., Huberman, B. A., and Williams, C. P. (1996). Special issue sat problems. Artificial Intelligence, 81(1-2).
13. Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan.
14. Jones, T. (1995a). Evolutionary Algorithms, Fitness Landscapes and Search. Ph.D. thesis, University of New Mexico, Albuquerque, New Mexico.
15. Jones, T. (1995b). One operator, one landscape. Technical Report SFI TR 95-02-025, Santa Fe Institute, Santa Fe, New Mexico.
16. De Jong, K. A., Potter, M. A., and Spears, W. M. (1997). Using problem generators to explore the effects of epistasis. In Back, T., editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 338-339, Morgan Kaufmann, San Francisco, California.
17. Kargupta, H. and Park, B. H. (1999). Fast construction of distributed and decomposed evolutionary representation. In Brave, S. and Wu, A. S., editors, Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference, pages 139-148, Morgan Kaufmann, San Francisco, California.
18. Kauffman, S. A. (1993). The Origins of Order. Oxford University Press, Oxford, UK.
19. Kauffman, S. A. (1995). At Home in the Universe. Oxford University Press, Oxford, UK.
20. Mendenhall, W. (1967). Introduction to Probability and Statistics. Second Edition. Wadsworth Publishing, Belmont, California.
21. Niven, I. (1965). Mathematics of Choice. Mathematical Association of America, Washington, DC.
22. Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley, Reading, Massachusetts.
23. Reeves, C. and Wright, C. (1995). An experimental design perspective on genetic algorithms. In Whitley, D. and Vose, M., editors, Foundations of Genetic Algorithms - 3, pages 7-22, Morgan Kaufmann, San Francisco, California.
24. Sole, R. and Goodman, B. (2000). Signs of Life: How Complexity Pervades Biology. Basic Books, New York, New York.
25. Weinberger, E. (1990). Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63:325-226.
26. Weinberger, E. (1996). Np completeness of kauffman's n-k model, a tuneably rugged fitness landscape, www.santafe.efdu/sfi/publications/Working-Papers/96-02-003.ps.
27. Whitley, D., Mathias, K., and Pyeatt, L. (1995). Hyperplane ranking in simple genetic algorithms. In Eshelman, L. J., editor. Proceedings of the Sixth International Conference on Genetic Algorithms, pages 231-238, Morgan Kaufmann, San Francisco, California.