Sequence Generation Using Machine Language Evolved by Genetic Programming

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

  author =       "Martin Johnson",
  title =        "Sequence Generation Using Machine Language Evolved by
                 Genetic Programming",
  booktitle =    "Procceedings of the 4th Asia-Pacific Conference on
                 Simulated Evolution And Learning (SEAL'02)",
  year =         "2002",
  editor =       "Lipo Wang and Kay Chen Tan and Takeshi Furuhashi and 
                 Jong-Hwan Kim and Xin Yao",
  address =      "Orchid Country Club, Singapore",
  month =        "18-22 " # nov,
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "981-04-7522-5",
  abstract =     "This paper presents a method for evolving simple
                 machine language programs which generate mathematical
                 sequences. The machine language used is a restricted
                 subset of x86 code and programs are recursive,
                 terminating when a fixed size stack overflows. A
                 program has the use of 4 registers and must write its
                 output into a small section of memory. Programs evolve
                 using a topological neighbourhood. Examples are shown
                 for power and Fibonacci sequences where the system
                 evolves interesting solutions unlike those that would
                 be found be a human programmer. The frequent random
                 replacement of part of the population is investigated
                 as a mechanism for avoiding local minima in the search
  notes =        "SEAL 2002 see

Genetic Programming entries for Martin Johnson