Paper Info
Title
Straight Line Programs: A New Linear Genetic Programming Approach
Abstract
Tree encodings of programs are well known for their representative power and are used very often in Genetic Programming. In this paper we experiment with a new data structure, named straight line program (slp), to represent computer programs. The main features of this structure are described and new recombination operators for GP related to slp's are introduced. Experiments have been performed on symbolic regression problems. Results are encouraging and suggest that the GP approach based on slp's consistently outperforms conventional GP based on tree structured representations.
Year
DOI
Venue
2008
10.1109/ICTAI.2008.14
ICTAI (2)
Keywords
Field
DocType
gp approach,genetic programming,computer program,main feature,new recombination operator,conventional gp,new linear genetic programming,new data structure,tree encodings,straight line program,representative power,straight line programs,tree data structures,computational modeling,genetic algorithms,tree structure,linear programming,regression analysis,data structure,data structures,encoding
Line (geometry),Computer science,Genetic programming,Theoretical computer science,Linear programming,Artificial intelligence,Linear genetic programming,Symbolic regression,Genetic algorithm,Data structure,Tree (data structure),Algorithm,Machine learning
Conference
Volume
ISSN
ISBN
2
1082-3409
978-0-7695-3440-4
Citations 
PageRank 
References 
6
0.67
9
Authors
3
Name
Order
Citations
PageRank
César L. Alonso1274.69
Jorge Puente217113.16
Josè L. Montaña38215.50