Redundancy and Computational Efficiency in Cartesian Genetic Programming

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

@Article{MS:IEEETEC:06,
  title =        "Redundancy and Computational Efficiency in Cartesian
                 Genetic Programming",
  author =       "Julian F. Miller and Stephen L. Smith",
  journal =      "IEEE Transactions on Evolutionary Computation",
  year =         "2006",
  volume =       "10",
  number =       "2",
  pages =        "167--174",
  month =        apr,
  keywords =     "genetic algorithms, genetic programming, Cartesian
                 genetic programming (CGP), code bloat, graph-based
                 representations, introns",
  DOI =          "doi:10.1109/TEVC.2006.871253",
  size =         "8 pages",
  abstract =     "The graph-based Cartesian genetic programming system
                 has an unusual genotype representation with a number of
                 advantageous properties. It has a form of redundancy
                 whose role has received little attention in the
                 published literature. The representation has genes that
                 can be activated or deactivated by mutation operators
                 during evolution. It has been demonstrated that this
                 junk has a useful role and is very beneficial in
                 evolutionary search. The results presented demonstrate
                 the role of mutation and genotype length in the
                 evolvability of the representation. It is found that
                 the most evolvable representations occur when the
                 genotype is extremely large and in which over 95
                 percent of the genes are inactive.",
}

Genetic Programming entries for Julian F Miller Stephen L Smith

Citations