Evolving Constructors for Infinitely Growing Sorting Networks and Medians

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

  author =       "Lukas Sekanina",
  title =        "Evolving Constructors for Infinitely Growing Sorting
                 Networks and Medians",
  booktitle =    "SOFSEM 2004: Theory and Practice of Computer Science",
  year =         "2004",
  volume =       "2932",
  series =       "Lecture Notes in Computer Science",
  pages =        "314--323",
  address =      "Czech Republic",
  month =        "24-30 " # jan,
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming, evolutionary
                 design, development, sorting network, median",
  ISSN =         "0302-9743",
  ISBN =         "3-540-20779-1",
  URL =          "http://www.fit.vutbr.cz/~sekanina/publ/sofsem04/sofsem04.pdf",
  URL =          "http://www.fit.vutbr.cz/research/view_pub.php?id=7368",
  DOI =          "doi:10.1007/b95046",
  size =         "10 pages",
  abstract =     "An approach is presented in which the object under
                 design can grow continually and infinitely. First, a
                 small object (that we call the embryo) has to be
                 prepared to solve the trivial instance of a problem.
                 Then the evolved program (the constructor) is applied
                 on the embryo to create a larger object (solving a
                 larger instance of the problem). Then the same
                 constructor is used to create a new instance of the
                 object from the created larger object and so on. Every
                 new instance of the object is able to perform the
                 function of all previous instances. As an example,
                 constructors for growing sorting and median networks
                 are evolved and analyzed.",
  notes =        "http://www.cs.cas.cz/sofsem/04/design/",

Genetic Programming entries for Lukas Sekanina