A new Linear Genetic Programming approach based on straight line programs: some Theoretical and Experimental Aspects

Created by W.Langdon from gp-bibliography.bib Revision:1.7630

@Article{Alonso:2009:IJAIT,

• author = "Cesar L. Alonso and Jose Luis Montana and Jorge Puente and Cruz Enrique Borges",
• title = "A new Linear Genetic Programming approach based on straight line programs: some Theoretical and Experimental Aspects",
• journal = "International Journal on Artificial Intelligence Tools",
• year = "2009",
• volume = "18",
• number = "5",
• pages = "757--781",
• keywords = "genetic algorithms, genetic programming, slp, Vapnik-Chervonenkis dimension, VC",
• oai = "oai:CiteSeerX.psu:10.1.1.301.3133",
• DOI = "doi:10.1142/S0218213009000391",
• URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.3133",
• URL = "http://paginaspersonales.deusto.es/cruz.borges/Papers/08IJAIT.pdf",
• 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, new recombination operators for GP related to slp's are introduced and a study of the Vapnik-Chervonenkis dimension of families of slp's is done. 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.",
• notes = "IJAIT",

}

Genetic Programming entries for Cesar Luis Alonso Jose Luis Montana Arnaiz Jorge Puente Peinador Cruz Enrique Borges

Citations