Evolution of iteration in genetic programming   [GP]

by

Koza, J., R. and Andre, D.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Evolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming (Conference proceedings), 1996
Keywords:genetic algorithms, genetic programming
Abstract:
The solution to many problems requires, or is facilitated by, the use of iteration. Moreover, because iterative steps are repeatedly executed, they must have some degree of generality. An automatic programming system [AP] should require that the user make as few problem-specific decisions as possible concerning the size, shape, and character of the ultimate solution to the problem. Work first presented at the Fourth Annual Conference on Evolutionary Programming [EP] in 1995 (EP-95) demonstrated that six then-new architecture-altering operations made it possible to automate the decision about the architecture of an overall program dynamically during a run of genetic programming. [GP] The question arises as to whether it is also possible to automate the decision about whether to employ iteration, how much iteration to employ, and the particular sequence of iterative steps. This paper introduces the new operation of restricted iteration creation that automatically creates a restricted iteration-performing branch out of a portion of an existing computer program during a run a genetic programming. Genetic programming [GP] [GP] with the new operation is then used (in conjunction with the other architecture-altering operations first presented at EP-95) to evolve a computer program to solve a non-trivial problem
Notes:
EP-96
Author(s) DL:Online papers for Koza, J., R.
Online papers for Andre, D.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{koza:1996:eiGP,
  author =       "John R. Koza and David Andre",
  title =        "Evolution of iteration in genetic programming",
  booktitle =    "Evolutionary Programming V: Proceedings of the Fifth
                 Annual Conference on Evolutionary Programming",
  year =         "1996",
  editor =       "Lawrence J. Fogel and Peter J. Angeline and T Baeck",
  publisher_address = "Cambridge, MA, USA",
  publisher =    "MIT Press",
  keywords =     "genetic algorithms, genetic programming",
  abstract =     "The solution to many problems requires, or is
                 facilitated by, the use of iteration. Moreover, because
                 iterative steps are repeatedly executed, they must have
                 some degree of generality. An automatic programming
                 system should require that the user make as few
                 problem-specific decisions as possible concerning the
                 size, shape, and character of the ultimate solution to
                 the problem. Work first presented at the Fourth Annual
                 Conference on Evolutionary Programming in 1995 (EP-95)
                 demonstrated that six then-new architecture-altering
                 operations made it possible to automate the decision
                 about the architecture of an overall program
                 dynamically during a run of genetic programming. The
                 question arises as to whether it is also possible to
                 automate the decision about whether to employ
                 iteration, how much iteration to employ, and the
                 particular sequence of iterative steps. This paper
                 introduces the new operation of restricted iteration
                 creation that automatically creates a restricted
                 iteration-performing branch out of a portion of an
                 existing computer program during a run a genetic
                 programming. Genetic programming with the new operation
                 is then used (in conjunction with the other
                 architecture-altering operations first presented at
                 EP-95) to evolve a computer program to solve a
                 non-trivial problem",
  notes =        "EP-96",
}