Evolution of Iterative Formulas Using Cartesian Genetic Programming

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

  author =       "Milos Minarik and Lukas Sekanina",
  title =        "Evolution of Iterative Formulas Using Cartesian
                 Genetic Programming",
  booktitle =    "Proceedings of the 15th International Conference on
                 Knowledge-Based and Intelligent Information and
                 Engineering Systems (KES 2011) Part {I}",
  year =         "2011",
  editor =       "Andreas K{\"o}nig and Andreas Dengel and 
                 Knut Hinkelmann and Koichi Kise and Robert J. Howlett and 
                 Lakhmi C. Jain",
  volume =       "6881",
  series =       "Lecture Notes in Computer Science",
  pages =        "11--20",
  address =      "Kaiserslautern, Germany",
  month =        sep # " 12-14",
  publisher =    "Springer",
  keywords =     "genetic algorithms, genetic programming, cartesian
                 genetic programming",
  isbn13 =       "978-3-642-23850-5",
  DOI =          "doi:10.1007/978-3-642-23851-2_2",
  size =         "10 pages",
  abstract =     "Many functions such as division or square root are
                 implemented in hardware using iterative algorithms. We
                 propose a genetic programming-based method to
                 automatically design simple iterative algorithms from
                 elementary functions. In particular, we demonstrated
                 that Cartesian Genetic Programming can evolve various
                 iterative formulae for tasks such as division or
                 determining the greatest common divisor using a
                 reasonable computational effort.",
  notes =        "Goldschmidt Division, Euclidean Algorithm",
  affiliation =  "Faculty of Information Technology, Brno University of
                 Technology, Bozetechova 2, 612 66 Brno, Czech
  bibdate =      "2011-09-13",
  bibsource =    "DBLP,

Genetic Programming entries for Milos Minarik Lukas Sekanina