Learning to sort by using evolution

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

@InProceedings{Trajkovski:2011:IIT,
  author =       "Igor Trajkovski and Zharko Aleksovski",
  title =        "Learning to sort by using evolution",
  booktitle =    "International Conference on Innovations in Information
                 Technology (IIT 2011)",
  year =         "2011",
  month =        "25-27 " # apr,
  pages =        "250--254",
  address =      "Abu Dhabi",
  size =         "5 pages",
  abstract =     "This paper present a work where Genetic Programming
                 (GP) was used to the task of evolving imperative sort
                 programs. A variety of interesting lessons were learnt.
                 With proper selection of the primitives, sorting
                 programs were evolved that are both general and
                 non-trivial. Unique aspect of our approach is that we
                 represent the individual programs with simple assembler
                 code, rather than usual tree like structure. We also
                 report the effect of different parameters on quality of
                 the programs and time needed for finding the
                 solution.",
  keywords =     "genetic algorithms, genetic programming, assembler
                 code, imperative sort programs, tree like structure,
                 sorting",
  DOI =          "doi:10.1109/INNOVATIONS.2011.5893827",
  notes =        "Also known as \cite{5893827}",
}

Genetic Programming entries for Igor Trajkovski Zharko Aleksovski

Citations