On the behavioral diversity of random programs

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 1636-1642

  Looks, Moshe ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Empirical study; Heuristics; Optimization; Representations

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INFORMATION THEORY; OPTIMIZATION; TREES (MATHEMATICS);

EMPIRICAL STUDY; FITNESS FUNCTION; REPRESENTATIONS;

GENETIC PROGRAMMING;

EID: 34548082030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277283     Document Type: Conference Paper

References (19)

1. L. Alonso and R. Schott. Random Generation of Trees. Kluwer Academic, 1995.
2. W. Bohm and A. Geyer-Schulz. Exact uniform initialization for genetic programming. In Foundations of Genetic Algorithms, 1996.
3. G. J. Chaitin. Algorithmic Information Theory. Cambridge University Press, 1987.
4. I. P. Gent and T. Walsh. The TSP phase transition. Artificial Intelligence, 1996.
5. S. Gustafson, E. K. Burke, and G. Kendall. Sampling of unique structures and behaviours in genetic programming. In European Conference on Genetic Programming, 2004.
6. C. Holman. Elements of an Expert System for Determining the Satisfiability of General Boolean Expressions. PhD thesis, Northwestern University, 1990.
7. J. R. Koza. Genetic Programming. MIT Press, 1992.
8. J. R. Koza. Genetic Programming IL MIT Press, 1994.
9. W. B. Langdon. Size fair and homologous tree crossovers for genetic programming. Genetic Programming and Evolvable Machines, 2000.
10. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002.
11. W. B. Langdon and R. Poli. The halting probability in von Neumann architectures. In European Conference on Genetic Programming, 2006.
12. S. Luke. Two fast tree-creation algorithms for genetic programming. IEEE Transactions on Evolutionary Computation, 2000.
13. S. Luke and L. Panait. A survey and comparison of tree generation algorithms. In Genetic and Evolutionary Computation Conference, 2001.
14. T. McConaghy and G. Gielen. Canonical form functions as a simple means for genetic programming to evolve human-interpretable functions. In Genetic and Evolutionary Computation Conference, 2006.
15. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic 'phase transitions'. Nature, 1999.
16. R. Solomonoff. A formal theory of inductive inference. Information and Control, 1964.
17. M. Tomassini, L. Vanneschi, P. Collard, and M. Clergue. A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation, 2005.
18. P. Wong and M. Zhang. Algebraic simplification of GP programs during evolution. In Genetic and Evolutionary Computation Conference, 2006.
19. T. Yu and J. Miller. Neutrality and the evolvability of Boolean function landscape. In European Conference on Genetic Programming, 2001.