keywords = "genetic algorithms, genetic programming, generality,
random search",
ISSN = "1389-2576",
DOI = "doi:10.1023/A:1011590227934",
size = "6 pages",
abstract = "The chance of solving a problem by random search of
linear random programs tends to a limit as their size
increases. When all outputs are equally used this limit
is no more than 2**(-|test set|). Where |test set| is
the size of the total test set. This is a
generalisation of a previous result,
\cite{langdon:1999:sptfs}.
Secondly, we show the chance of finding a long linear
general solution by random search is exponentially
small.",
notes = "No Generalise See also RN/01/14
http://www.cs.ucl.ac.uk/staff/W.Langdon/maxproduct/
Article ID: 335707