Genetic algorithms in Haskell with polytypic programming

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

@MastersThesis{oai:CiteSeerPSU:196426,
  title =        "Genetic algorithms in Haskell with polytypic
                 programming",
  author =       "Mans Vestin",
  year =         "1999",
  school =       "Goteborg University",
  address =      "Sweden",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.cs.chalmers.se/~patrikj/poly/others/geneticalgorithmsinhaskellwithpolytypicprogramming.ps.gz",
  URL =          "http://citeseer.ist.psu.edu/196426.html",
  size =         "42 pages",
  citeseer-isreferencedby = "oai:CiteSeerPSU:19650",
  annote =       "The Pennsylvania State University CiteSeer Archives",
  language =     "en",
  oai =          "oai:CiteSeerPSU:196426",
  abstract =     "Evolution is the main optimising tool of the nature.
                 You just have to look at all the animals, plants and
                 human beings to be amazed by their complex and well
                 suited genes. This is not the work of a random search
                 through all possible genotypes, it is the result of a
                 general and efficient optimising algorithm. Genetic
                 algorithms and genetic programming are methods based on
                 the concept of evolution and Darwinian natural
                 selection. They are powerful methods of finding
                 solutions to a vide variety of problems. This text
                 describes a program written in the functional language
                 Haskell, where evolution is used to solve three example
                 problems. Two examples concern picture generation, and
                 the third is a planning problem. Due to the use of
                 polytypism, the program is easily extended to solve new
                 problems using the same algorithm.",
}

Genetic Programming entries for Mans Vestin

Citations