Generality and Difficulty in Genetic Programming: Evolving a Sort   [GP]

by

Kinnear, K., E. and Jr.

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: Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93 (Conference proceedings), 1993, p. 287-294
Keywords:genetic algorithms, genetic programming
Abstract:
application of GP to evolving sorting algorithms and the lessons learned from this. Plus the discovery of a connection between size and generality.
Notes:
Adding inverse prog size decreases size of progs and makes them more general. Ref Bickel ICGA-2 Tree structured rules in GAs Kinnear IEEE Press, ICNN U M O'Reilly and F. Oppacher "An experimental Perspective on Genetic Programming" in "Parallel Problem solving from nature" R.Manner and B. Manderick (eds) Holland:Elsevier. Loads of references on Steady State v generational (also see kim's own reference) Various fiddling to find balance of size parameters. Various terminal/function sets tried (less powerful -> more difficult) Smaller successful programs more general.
URL(s):(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{icga93:kinnear,
  author =       "Kenneth E. {Kinnear, Jr.}",
  title =        "Generality and Difficulty in Genetic Programming:
                 Evolving a Sort",
  year =         "1993",
  booktitle =    "Proceedings of the 5th International Conference on
                 Genetic Algorithms, ICGA-93",
  editor =       "Stephanie Forrest",
  publisher =    "Morgan Kaufmann",
  pages =        "287--294",
  month =        "17-21 " # jul,
  address =      "University of Illinois at Urbana-Champaign",
  keywords =     "genetic algorithms, genetic programming",
  size =         "8 pages",
  URL =          "ftp://ftp.mad-scientist.com/pub/genetic-programming/papers/kinnear.icga93.ps.Z",
  abstract =     "application of GP to evolving sorting algorithms and
                 the lessons learned from this. Plus the discovery of a
                 connection between size and generality.",
  notes =        "Adding inverse prog size decreases size of progs and
                 makes them more general.

                 Ref Bickel ICGA-2 Tree structured rules in GAs Kinnear
                 IEEE Press, ICNN U M O'Reilly and F. Oppacher {"}An
                 experimental Perspective on Genetic Programming{"} in
                 {"}Parallel Problem solving from nature{"} R.Manner and
                 B. Manderick (eds) Holland:Elsevier.

                 Loads of references on Steady State v generational
                 (also see kim's own reference)

                 Various fiddling to find balance of size parameters.
                 Various terminal/function sets tried (less powerful ->
                 more difficult) Smaller successful programs more
                 general.",
}