The computational complexity of simple GA problems
Created by W.Langdon from
gp-bibliography.bib Revision:1.8081
- @InProceedings{meysenburg:2000:TG,
-
author = "Mark M. Meysenburg",
-
title = "The computational complexity of simple GA problems",
-
booktitle = "Graduate Student Workshop",
-
year = "2000",
-
editor = "Conor Ryan and Una-May O'Reilly and
William B. Langdon",
-
pages = "293--296",
-
address = "Las Vegas, Nevada, USA",
-
month = "8 " # jul,
-
keywords = "genetic algorithms, genetic programming",
-
notes = "GECCO-2000WKS Part of \cite{wu:2000:GECCOWKS}",
- }
Genetic Programming entries for
Mark M Meysenburg
Citations