Show simple item record

A new linear genetic programming approach based on straight line programs: Some theoretical and experimental aspects

dc.contributor.authorAlonso González, César Luis 
dc.contributor.authorMontaña Arnaiz, José Luis
dc.contributor.authorPuente Peinador, Jorge 
dc.contributor.authorBorges Hernández, Cruz Enrique
dc.identifier.citationInternational Journal on Artificial Intelligence Tools, 18, p. 757-781 (2009); doi:10.1142/S0218213009000391spa
dc.description.abstractTree 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
dc.description.sponsorshipCésar Luis Alonso and José Luis Montaña are supported by spanish grant TIN2007- 67466-C02-02. Jorge Puente is supported by Spanish grant TIN2007-67466-C02-01. Cruz Enrique Borges is supported by FPU program and MTM2004-01167
dc.format.extentp. 757-781spa
dc.publisherWorld Scientific Publishing Company
dc.relation.ispartofInternational Journal on Artificial Intelligence Tools, 18spa
dc.rights© World Scientific Publishing Company
dc.titleA new linear genetic programming approach based on straight line programs: Some theoretical and experimental aspectseng
dc.typejournal article
dc.rights.accessRightsopen access

Files in this item


This item appears in the following Collection(s)

Show simple item record