An Efficient Selection Strategy for Digital Circuit Evolution

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

  author =       "Zbysek Gajda and Lukas Sekanina",
  title =        "An Efficient Selection Strategy for Digital Circuit
  booktitle =    "Proceedings of the 9th International Conference
                 Evolvable Systems: From Biology to Hardware, ICES
  year =         "2010",
  editor =       "Gianluca Tempesti and Andy M. Tyrrell and 
                 Julian F. Miller",
  series =       "Lecture Notes in Computer Science",
  volume =       "6274",
  pages =        "13--24",
  address =      "York",
  month =        sep # " 6-8",
  publisher =    "Springer",
  keywords =     "genetic algorithms, genetic programming, cartesian
                 genetic programming",
  isbn13 =       "978-3-642-15322-8",
  DOI =          "doi:10.1007/978-3-642-15323-5_2",
  size =         "12 pages",
  abstract =     "In this paper, we propose a new modification of
                 Cartesian Genetic Programming (CGP) that enables to
                 optimise's digital circuits more significantly than
                 standard CGP. We argue that considering fully
                 functional but not necessarily smallest-discovered
                 individual as the parent for new population can
                 decrease the number of harmful mutations and so improve
                 the search space exploration. This phenomenon was
                 confirmed on common benchmarks such as combinational
                 multipliers and the LGSynth91 circuits.",

Genetic Programming entries for Zbysek Gajda Lukas Sekanina