- author = "R. Poli",
- title = "Some Steps Towards a Form of Parallel Distributed Genetic Programming",
- booktitle = "The 1st Online Workshop on Soft Computing (WSC1)",
- year = "1996",
- broken = "http://www.bioele.nuee.nagoya-u.ac.jp/wsc1/",
- month = "19--30 " # aug,
- organisation = "Research Group on ECOmp of the Society of Fuzzy Theory and Systems (SOFT)",
- publisher = "Nagoya University, Japan",
- keywords = "genetic algorithms, genetic programming, parallel programs, graphs, evolutionary computation",
-
URL = "
ftp://ftp.cs.bham.ac.uk/pub/authors/R.Poli/wsc96.ps.gz",
- abstract = "Genetic Programming is a method of program discovery consisting of a special kind of genetic algorithm capable of operating on non-linear chromosomes (parse trees) representing programs and an interpreter which can run the programs being optimised. This paper describes PDGP (Parallel Distributed Genetic Programming), a new form of genetic programming which is suitable for the development of fine-grained parallel programs. PDGP is based on a graph-like representation for parallel programs which is manipulated by crossover and mutation operators which guarantee the syntactic correctness of the offspring. The paper describes these operators and reports some preliminary results obtained with this paradigm.",
- size = "6 pages",
-
notes = "email WSC1 organisers
wsc@bioele.nuee.nagoya-u.ac.jp
Here PDGP was used to solve the even-3 parity problem. Results were better than Koza's with a minimum effort of 25,000 evals with one particular grid configuration, and many grid configurations giving E<50,000",
