Evolving Computer Programs without Subtree Crossover

by

Chellapilla, K.

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: IEEE Transactions on Evolutionary Computation (Journal), 1997, p. 209-216
Keywords:Evolutionary Programming, genetic algorithms, genetic programming symbolic expressions, variation operators
Notes:
negative results on building block hypothesis, C++ code available, Compares use of EP using 6 types of tree mutation with GP on: 6-mux, 3, 4, 5, 6 parity, symbolic regression, two box, two spirals, Santa Fe trail artificial ant, cart centering, 4 variation on broom balancing. In general EP wins in terms of Effort to find the solution. Gives algorithm used to create initial random trees
Author(s) DL:Online papers for Chellapilla, K.
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:
@Article{Chellapilla:1998:eptm,
  author =       "Kumar Chellapilla",
  title =        "Evolving Computer Programs without Subtree Crossover",
  journal =      "IEEE Transactions on Evolutionary Computation",
  year =         "1997",
  volume =       "1",
  number =       "3",
  pages =        "209--216",
  month =        sep,
  keywords =     "Evolutionary Programming, genetic algorithms, genetic
                 programming symbolic expressions, variation operators",
  notes =        "negative results on building block hypothesis, C++
                 code available, Compares use of EP using 6 types of
                 tree mutation with GP on: 6-mux, 3, 4, 5, 6 parity,
                 symbolic regression, two box, two spirals, Santa Fe
                 trail artificial ant, cart centering, 4 variation on
                 broom balancing. In general EP wins in terms of Effort
                 to find the solution. Gives algorithm used to create
                 initial random trees",
}