Genetic programming 

Genetic programming uses methods which are similar to genetic algorithms, but is based on programs which perform tasks the results of which can then be evaluated to deliver a fitness function similar to GAs. Instead of using pools of parameter lists to be evaluated by some evaluation procedure, GP uses pools of programs which are to be run to perform the required task. A technical difference between GAs and GPs is that GAs use list structures, often fixed size, for the storage of their data, while GPs use tree structures which can vary in size and shape for each program used in the program pools.

So far GPs have successfully solved some toy problems, such as the lawn mower problem, but the method is very computationally intensive, and may not compare favourably where simpler methods, such as genetic algorithms or random optimisation can be used instead. It is possible that some more complex problems may be more amenable to solution using GPs than other optimization methods.

Unfortunately, due to the lack of solid theory regarding the performance of genetic programming vs. traditional search methods (such as hill-climbing), genetic programming remains a sort of pariah amongst the various techniques of search. While genetic programming has achieved results that are as good as and sometimes better than human-generated results, more work needs to be done on the theory in order to bring the technique into more widespread use.

References:

• Genetic Programming FAQ (http://www.cs.ucl.ac.uk/research/genprog/gp2faq/gp2faq.html)
• The Hitch-Hiker's Guide to Evolutionary Computation (http://www.faqs.org/faqs/ai-faq/genetic/part1/preamble.html)
• John Koza's Genetic Programming Site (http://www.genetic-programming.com)

Koza, J.R (1992), Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press

Koza, J.R (1994), Genetic Programming II: Automatic Discovery of Reusable Programs, MIT Press

Koza,J.R, Bennett, F,H, Andre, D, and Keane, M.A (1999), Genetic Programming III: Darwinian Invention and Problem Solving, Morgan Kaufmann

of the official release.html">release dates, leaving time for better editing. even years after the official publication date. Please note neither this listing nor its contents are final til The official release date of all Project gutenberg.html">Gutenberg eBooks is at preliminary version may often be posted for suggestion, comment http://gutenberg.net or Gutenberg, including how to donate, how to help produce our new Those of you who want to download any eBook before announcement also a good way to get them instantly upon announcement, as the announcement goes out in the Project Gutenberg Newsletter. http://www.ibiblio.org/gutenberg/etext03 or as it appears in our Newsletters. time it takes us, a rather conservative estimate, is fifty hours searched and analyzed, the copyright letters written, etc. Our per.html">per text is nominally estimated at one dollar then we produce $2 files per month: 1240 more eBooks in 2001.html">2001 for a total.html">total of 4000+ If they reach just 1-2% of the world's population then the total This is ten thousand titles each to one hundred million readers, 10 1991 January 1000 1997 August 2000 1999 December 3000 2001 November 6000 2002 December* 10000 2004 January* to secure a future for Project Gutenberg into the next millennium. We need your donations more than ever! As of February, 2002, contributions are being solicited from people Delaware, District of Columbia, Florida, Georgia, Hawaii, Illinois, Michigan, Mississippi, Missouri, Montana, Nebraska, Nevada, New Oklahoma, Oregon, Pennsylvania, Rhode Island, South Carolina, South .

 On wordlookup.net  

All is still licensed under the GNU FDL.
It uses material from the wikipedia.