Evolving integer recurrences using genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

  author =       "Stefan J. Johansson",
  title =        "Evolving integer recurrences using genetic
  institution =  "Faculteit der Wiskunde en Informatica, VU Amsterdam",
  year =         "1996",
  number =       "IR 402",
  address =      "Holland",
  month =        "2 " # apr,
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://citeseer.ist.psu.edu/cache/papers/cs/2226/http:zSzzSzwww.sikt.hk-r.sezSz~soczSzpublicationszSz.zSz1996zSzeirgp.pdf/evolving-integer-recurrences-using.pdf",
  URL =          "http://citeseer.ist.psu.edu/177550.html",
  abstract =     "his report addresses the problem of synthesizing
                 integer recurrences by genetic programming (GP). A
                 number of alternative approaches were proposed and
                 tested by running thousands of experiments. In
                 particular the following aspects were investigated:
                 approaches to base cases, population size, different
                 fitness measures and superiority of GP over random
                 search. Results of the experiments showed that our
                 approach (fixed base cases) is much better than the
                 conventional one (evolved base cases) on...",
  notes =        "Masters Thesis, CWI

                 Shelf mark A-26012 CWI library 2-12-98",
  size =         "38 pages",

Genetic Programming entries for Stefan J Johansson