The Time Complexity of Genetic Algorithms and the Theory of Recombination Operators   [GA]

by

Ankenbrandt, C., A.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: 1990
Notes:
Department of Computer Science
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@PhdThesis{Ankenbrandt:1990:TCG,
  author =       "C. A. Ankenbrandt",
  title =        "The Time Complexity of Genetic Algorithms and the
                 Theory of Recombination Operators",
  school =       "Tulane University",
  year =         "1990",
  address =      "New Orleans, LA",
  note =         "Department of Computer Science",
}