Genetically breeding populations of computer programs to solve problems in artificial intelligence

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

@InProceedings{Koza:1990:GPai,
  author =       "John R. Koza",
  title =        "Genetically breeding populations of computer programs
                 to solve problems in artificial intelligence",
  booktitle =    "Proceedings of the Second International Conference on
                 Tools for AI",
  year =         "1990",
  pages =        "819--827",
  address =      "Herndon, Virginia, USA",
  month =        "6-9 " # nov,
  publisher =    "IEEE Computer Society Press, Los Alamitos, CA, USA",
  keywords =     "genetic algorithms, genetic programming, artificial
                 ant, artificial intelligence, computer programs,
                 evader, game tree, genetic breeding, genetic
                 programming paradigm, hierarchical computer programs,
                 independently acting pursuer, irregular trail, minimax
                 control strategy, simple discrete two-person game,
                 computer games, discrete systems, knowledge based
                 systems, minimax techniques, problem solving",
  URL =          "http://www.genetic-programming.com/jkpdf/tai1990.pdf",
  DOI =          "doi:10.1109/TAI.1990.130444",
  size =         "10 of 9 pages",
  abstract =     "This paper describes the recently developed 'genetic
                 programming' paradigm which genetically breeds
                 populations of computer programs to solve problems. In
                 genetic programming, the individuals in the population
                 are hierarchical computer programs of various sizes and
                 shapes. Three applications to problems in artificial
                 intelligence are presented.",
}

Genetic Programming entries for John Koza

Citations