%0 Conference Paper %1 poli:1996:WSC %A Poli, R. %B The 1st Online Workshop on Soft Computing (WSC1) %C http://www.bioele.nuee.nagoya-u.ac.jp/wsc1/ %D 1996 %I Nagoya University, Japan %K algorithms, computation evolutionary genetic graphs, parallel programming, programs, %T Some Steps Towards a Form of Parallel Distributed Genetic Programming %U ftp://ftp.cs.bham.ac.uk/pub/authors/R.Poli/wsc96.ps.gz %X 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.

@inproceedings{poli:1996:WSC, 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.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {http://www.bioele.nuee.nagoya-u.ac.jp/wsc1/}, author = {Poli, R.}, biburl = {https://www.bibsonomy.org/bibtex/24106d72ea60b4dbbc016249552128a4e/brazovayeye}, booktitle = {The 1st Online Workshop on Soft Computing (WSC1)}, interhash = {9b389aa4ba38ff6d8212afa3d46407b4}, intrahash = {4106d72ea60b4dbbc016249552128a4e}, keywords = {algorithms, computation evolutionary genetic graphs, parallel programming, programs,}, month = {19--30 August}, 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}, organisation = {Research Group on ECOmp of the Society of Fuzzy Theory and Systems (SOFT)}, publisher = {Nagoya University, Japan}, size = {6 pages}, timestamp = {2008-06-19T17:49:37.000+0200}, title = {Some Steps Towards a Form of Parallel Distributed Genetic Programming}, url = {ftp://ftp.cs.bham.ac.uk/pub/authors/R.Poli/wsc96.ps.gz}, year = 1996 }