Grammatical Evolution: Evolving Programs for an Arbitrary Language
作者： Conor Ryan , JJ Collins , Michael O Neill
DOI: 10.1007/BFB0055930
关键词:
摘要: Abstract We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar definition is …
acm.org
springer.com
sci-hub.se 参考文章(7)
Wolfgang Banzhaf, Robert E. Keller, Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes Proceedings of the 1st annual conference on genetic programming. pp. 116- 122 ,(1996)
Man Leung Wong, Kwong Sak Leung, Applying logic grammars to induce sub-functions in genetic programming ieee international conference on evolutionary computation. ,vol. 2, pp. 737- 740 ,(1995) , 10.1109/ICEC.1995.487477
Bradley Korb, David E. Goldberg, Kalyanmoy Deb, Messy genetic algorithms: motivation, analysis, and first results Complex Systems. ,vol. 3, ,(1989)
P.A. Whigham, Inductive bias and genetic programming 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA). pp. 461- 466 ,(1995) , 10.1049/CP:19951092
P. A. Whigham, Search bias, language bias and genetic programming Proceedings of the 1st annual conference on genetic programming. pp. 230- 237 ,(1996)
Una-May O'Reilly, The impact of external dependency in genetic programming primitives ieee international conference on evolutionary computation. pp. 154- 168 ,(1998) , 10.1007/3-540-64575-6_47
Gerald D. Elseth, Kandy D. Baumgardner, Principles of Modern Genetics ,(1995)