Cartesian genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1802, Issue , 2000, Pages 121-132

  Miller, Julian F ^a   Thomson, Peter ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; GENETIC ALGORITHMS;

CARTESIAN GENETIC PROGRAMMING; COMPUTATIONAL EFFORT; LINEAR STRINGS; NODE FUNCTIONS; ORDER POLYNOMIALS; SANTA FE ANT PROBLEMS; SEARCH STRATEGIES; SYMBOLIC REGRESSION PROBLEMS;

GENETIC PROGRAMMING;

EID: 84946491745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46239-2_9     Document Type: Conference Paper

References (19)

1. Banzhaf, W.: Genetic Programming for Pedestrains, Technical Report No. 93-03, Mitsubishi Electric Research Labs, Cambridge, MA (1993)
2. Banzhaf, W.: Genotype-Phenotype-Mapping and Neutral Variation: A Case study in Genetic Programming. In: Davidor, Y., Schwefel, H.-P., R. Manner, R. (eds.): Proceedings of the conference on Parallel Problem Solving from Nature III. Springer-Verlag, Berlin Heidelberg New York (1994) 322-332.
3. Chellapilla K.: Evolutionary programming with tree mutations: Evolving computer programs without crossover. In: Koza, J. R., et al. (eds.): Genetic Programmimg 1997: Proceedings of the Third Annual Conference on Genetic Programming. Morgan Kaufmann, San Francisco, CA. (1998) 432-438.
4. Fogel, L. J., Owens, A. J., Walsh, M. J.: Artificial Intelligence through Simulated Evolution, Wiley (1996)
5. Fogel, D. B.: Evolutionary Computation: Towards a New Philosophy of Machine Intelligence, IEEE Press (1995)
6. Harvey, I., Thompson, A.: Through the labyrinth evolution finds a way: A silicon ridge. In: Higuchi, T., Iwata, M., Liu, W. (eds.): Proceedings of First International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, Vol. 1259. Springer-Verlag, Berlin Heidelberg New York (1996) 406-422
7. Huynen, M. A., Stadler, P. F., Fontana, W.: Smoothness within ruggedness: The role of neutrality in adaptation. Proceedings of the National Academy of Science U.S.A. Vol. 93 (1996) 397-401
8. Kimura, M.: Nature, Vol. 217 (1968) 624-626.
9. Kimura, M.: The Neutral Theory of Molecular Evolution, Cambridge, Cambridge University Press (1983)
10. Koza, J. R.: Genetic Programming: On the programming of computers by means of natural selection. MIT Press (1992)
11. Koza, J. R.: Genetic Programming II: Automatic Discovery of Reusable Subprograms. MIT Press (1994)
12. Langdon, W. B., Poli, R.: Why Ants are Hard. In: Koza, J. R. et al. (eds.) Proceedings of the Third Annual Conference on Genetic Programming. Morgan Kaufmann, San Francisco, CA (1998) 193-201
13. Miller J. F., Thomson P.: Aspects of Digital Evolution: Geometry and Learning. In: Sip- per, M. et al (eds.): Proceedings of the Second International Conference on Evolvable Systems: From Biology to Hardware, Lecture Notes in Computer Science, Vol. 1478. Springer-Verlag, Berlin Heidelberg New York (1998) 25-35
14. Miller, J. F.: An empirical study of the efficiency of learning Boolean functions using a Cartesian Genetic Programming Approach. In: Banzhaf, W. et al.: Proceedings of the Genetic and Evolutionary Computation Conference (GECC099), Morgan Kaufmann, San Francisco, CA (1999) 1135-1142
15. Ohta, T.: Slightly deleterious mutant substitutions in evolution. Nature Vol. 246 (1973) 9697
16. Ohta, T.: The nearly neutral theory of molecular evolution. Annual Review of Ecology and Systematics Vol. 23 (1992) 263-286
17. Poli, T.: Parallel distributed genetic programming. Technical report CSRP-96-15, School of Computer Science, The University of Birmingham, UK (1996)
18. Poli, R.: Evolution of graph-like programs with parallel distributed genetic programming. In: Back, T. (ed): Genetic Algorithms: Proceedings of the Seventh International Conference, Morgan Kaufmann, San Francisco, CA (1997) 346-353
19. Teller, A., Veloso, M.: PADO: Learning tree structured algorithms for orchestration into an object recognition system. Technical Report CMU-CS-95-101, Dept, of Computer Science, Carnegie Mellon University, Pittsburg (1995)