Iteration Over Vectors in Genetic Programming
作者： Evan Kirshenbaum
DOI:
关键词:
摘要: This paper describes the results of using genetic programming with bounded iteration constructs, which allow computational complexity solution to be an emergent property. It is shown that such operators render even-6-parity problem trivial, and experiments other, harder, problems require O(n) are shown. method contrasted Automatically Defined Iterators.
参考文章(11)
Evan Kirshenbaum, Genetic programming with statically scoped local variables genetic and evolutionary computation conference. pp. 459- 468 ,(2000)
John R. Koza, Architecture-Altering Operations for Evolving the Architecture of a Multi-Part Program in Genetic Programming Stanford University. ,(1994)
W. B. Langdon, Using data structures within genetic programming Proceedings of the 1st annual conference on genetic programming. pp. 141- 149 ,(1996)
John R. Koza, Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems Stanford University. ,(1990)
John R. Koza, Genetic Programming II: Automatic Discovery of Reusable Programs ,(1994)
Wolfgang Banzhaf, Robert E. Keller, Peter Nordin, Genetic Programming: An Introduction ,(1997)
John R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection ,(1992)
J.R.W. Hunter, Programming—An introduction Microelectronics Reliability. ,vol. 21, pp. 401- 407 ,(1981) , 10.1016/0026-2714(81)90047-0
David J. Montana, Strongly typed genetic programming Evolutionary Computation. ,vol. 3, pp. 199- 230 ,(1995) , 10.1162/EVCO.1995.3.2.199
John R Koza, None, Genetic Programming III: Darwinian Invention and Problem Solving ,(1999)