Created by W.Langdon from gp-bibliography.bib Revision:1.8187
The framework supports important additions to GP like automatically defined functions and random constants. Once a problem has been implemented using PM-DGP the time consuming task of fitness evaluation can be distributed using the idle time of networked computers running Microsoft Windows or Linux using a GUI server and clients. The system is designed to be flexible and extensible. Many aspects of a GP run, the nodes, node sets, result type and genetic algorithm, are configurable at run time using a simple textual configuration file.
The system offers a flexible yet efficient object-oriented genome interpreter that can work with different result types and uses a prefix coding to store its programs. When distributing the fitness evaluation the genome interpreter has to be sent to a client over the network only once after which the programs can be sent using only one to two bytes per node. Several example implementations of GP problems are included: symbolic regression, parity, artificial ant, royal tree and edge detector. An extensive tutorial showing how to implement the lawn mower problem is included in this report.",
http://sourceforge.net/projects/pmdgp/",
Genetic Programming entries for P G M van der Meulen