DocumentCode
3168898
Title
Can tree adjunct grammar guided genetic programming be good at finding a needle in a haystack? A case study
Author
Hoai, N.X. ; McKay, R.I. ; Essam, D.
Author_Institution
Sch. of Comput. Sci., Univ. of New South Wales, Canberra, ACT, Australia
Volume
2
fYear
2002
fDate
29 June-1 July 2002
Firstpage
1113
Abstract
In this paper, we experiment with tree-adjunct grammar guided genetic programming (TAG3P) on even parity problems in order to investigate the robustness of TAG3P on the problems classified as "finding a needle in a haystack". We compare the result with grammar guided genetic programming (GGGP) and genetic programming (GP). The results show that TAG3P does not work well on the problems due to the nature of the search space and the structure of the solution.
Keywords
Boolean functions; evolutionary computation; grammars; tree searching; GGGP; GP; TAG3P robustness; boolean functions; even parity problems; evolutionary algorithms; needle in a haystack problems; search space; symbolic regression problems; tree adjunct grammar guided genetic programming; Australia; Bioinformatics; Classification tree analysis; Computer aided software engineering; Computer science; Evolutionary computation; Genetic programming; Genomics; Needles; Robustness;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference on
Print_ISBN
0-7803-7547-5
Type
conf
DOI
10.1109/ICCCAS.2002.1178980
Filename
1178980
Link To Document