César Luis Alonso

Learn More
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(More)
Very often symbolic regression, as addressed in Genetic Programming (GP), is equivalent to approximate interpolation. This means that, in general, GP algorithms try to fit the sample as better as possible but no notion of generalization error is considered. As a consequence, overfitting, code-bloat and noisy data are problems which are not satisfactorily(More)
We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on Empirical Risk Minimization (ERM) and model selection based on Structural Risk Minimization (SRM). For this purpose we have identified the main components which determine the capacity of(More)
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(More)
In this paper we propose a tool for controlling the complexity of Genetic Programming models. The tool is supported by the theory of VapnikChervonekis dimension and is combined with a novel representation of models named straight line program. Experimental results, implemented on conventional algebraic structures (such as polynomials) and real problems,(More)
In this paper we face the problem of determining the best partial order among the subgoals of a query in order for this query to be evaluated under Independent AND Parallelism. This is the most common source of parallelism exploited by the different models that have been proposed to evaluate logic programs in parallel. This problem is proved to be NP-hard,(More)