ACM Home Page
Please provide us with feedback. Feedback
Backward-chaining genetic programming
Full text PdfPdf (115 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 2005 conference on Genetic and evolutionary computation table of contents
Washington DC, USA
POSTER SESSION: Genetic programming table of contents
Pages: 1777 - 1778  
Year of Publication: 2005
ISBN:1-59593-010-8
Authors
Riccardo Poli  University of Essex, UK
William B. Langdon  University of Essex, UK
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 24,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1068009.1068306
What is a DOI?

ABSTRACT

This paper presents a backward-chaining version of GP.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Poli. Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms. In Proceedings of the Foundations of Genetic Algorithms Workshop (FOGA 8), 4th January 2005.
 
2
R. Poli and W. B. Langdon. Backward-chaining genetic programming. Technical Report CSM-425, Department of Computer Science, University of Essex, 2005.
 
3
R. Poli and W. B. Langdon. Running genetic programming backward. In R. L. Riolo, B. Worzel, and T. Yu, editors, Genetic Programming Theory and Practice. Kluwer, 2005.


Collaborative Colleagues:
Riccardo Poli: colleagues
William B. Langdon: colleagues