Skip to main content
Conference Proceedings

Some experimental results with tree adjunct grammar guided genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2278 228-237
DOI: 10.1007/3-540-45984-7_22
8Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Tree-adjunct grammar guided genetic programming (TAG3P) [5] is a grammar guided genetic programming system that uses context-free grammars along with tree-adjunct grammars as means to set language bias for the genetic programming system. In this paper, we show the experimental results of TAG3P on two problems: symbolic regression and trigonometric identity discovery. The results show that TAG3P works well on those problems.

Cite

CITATION STYLE

APA

Hoai, N. X., McKay, R. I., & Essam, D. (2002). Some experimental results with tree adjunct grammar guided genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2278, pp. 228–237). Springer Verlag. https://doi.org/10.1007/3-540-45984-7_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free