DocumentCode
342654
Title
Structure abstraction and genetic programming
Author
Yu, Tina
Author_Institution
Dept. of Comput. Sci., Univ. Coll. London, UK
Volume
1
fYear
1999
fDate
1999
Abstract
The selection of program representation can have strong impact on the performance of genetic programming. Previous work has shown that a particular program representation which supports structure abstraction is very effective in solving the general even parity problem. We investigate program structures and analyze all perfect solutions in the search space to provide explanation of why structure abstraction is so effective with this problem. This work provides guidelines for the application of structure abstraction to other problems
Keywords
evolutionary computation; search problems; general even parity problem; genetic programming; perfect solutions; program representation selection; program structures; search space; structure abstraction; Boolean functions; Computer science; Educational institutions; Evolutionary computation; Genetic programming; Guidelines; Problem-solving; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on
Conference_Location
Washington, DC
Print_ISBN
0-7803-5536-9
Type
conf
DOI
10.1109/CEC.1999.781995
Filename
781995
Link To Document