Created by W.Langdon from gp-bibliography.bib Revision:1.8620
http://i.stanford.edu/TR/CS-TR-95-1542.html",
ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/95/1542/CS-TR-95-1542.pdf",
http://www.genetic-programming.com/jkpdf/tr1542parallelsuversion.pdf",
A comparison is made of the computational effort required to solve the problem of symbolic regression of the Boolean even-5-parity function with different migration rates. Genetic programming required the least computational effort with an 8% migration rate. Moreover, this computational effort was less than that required for solving the problem with a serial computer and a panmictic population of the same size. That is, apart from the nearly linear speed-up in executing a fixed amount of code inherent in the parallel implementation of genetic programming, parallelization delivered more than linear speed-up in solving the problem using genetic programming.",
Genetic Programming entries for John Koza David Andre