peer-reviewedAn open question within Genetic Programming (GP) is how to characterize problem difficulty. The goal is to develop predictive tools that estimate how difficult a problem is for GP to solve. Here we consider two groups of methods. We call the first group Evolvability Indicators (EI), measures that capture how amendable the fitness landscape is to a GP search. Examples of EIs are Fitness Distance Correlation (FDC) and Negative Slope Coefficient (NSC). The second group are Predictors of Expected Performance (PEP), models that take as input a set of descriptive attributes of a problem and predict the expected performance of GP. This paper compares an EI, the NSC, and a PEP model for a GP classifier. Results suggest that...
Congress on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Barcelona, ...
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can ...
Genetic programming (GP) is an evolutionary computation technique to solve problems in an automated,...
International audienceOne of the main open problems within Genetic Programming (GP) is to meaningful...
International audienceIn the field of Genetic Programming (GP) a question exists that is difficult t...
An open question within Genetic Programming (GP) is how to characterize problem difficulty. The goal...
peer-reviewedDuring the development of applied systems, an important problem that must be addressed...
During the development of applied systems, an important problem that must be addressed is that of ch...
The study of problem difficulty is an open issue in Genetic Programming (GP). Thegoal of this work i...
The estimation of problem difficulty is an open issue in genetic programming (GP). The goal of this ...
The estimation of problem difficulty is an open issue in Genetic Programming(GP). The goal of this w...
International audienceThis paper presents an investigation of genetic programming fitness landscapes...
This paper addresses the issue of what makes a problem genetic programming (GP)-hard by considering ...
We develop a tree-based genetic programming system, capable of modelling evolvability during evoluti...
Abstract. This paper presents an investigation of genetic programming fitness landscapes. We propose...
Congress on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Barcelona, ...
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can ...
Genetic programming (GP) is an evolutionary computation technique to solve problems in an automated,...
International audienceOne of the main open problems within Genetic Programming (GP) is to meaningful...
International audienceIn the field of Genetic Programming (GP) a question exists that is difficult t...
An open question within Genetic Programming (GP) is how to characterize problem difficulty. The goal...
peer-reviewedDuring the development of applied systems, an important problem that must be addressed...
During the development of applied systems, an important problem that must be addressed is that of ch...
The study of problem difficulty is an open issue in Genetic Programming (GP). Thegoal of this work i...
The estimation of problem difficulty is an open issue in genetic programming (GP). The goal of this ...
The estimation of problem difficulty is an open issue in Genetic Programming(GP). The goal of this w...
International audienceThis paper presents an investigation of genetic programming fitness landscapes...
This paper addresses the issue of what makes a problem genetic programming (GP)-hard by considering ...
We develop a tree-based genetic programming system, capable of modelling evolvability during evoluti...
Abstract. This paper presents an investigation of genetic programming fitness landscapes. We propose...
Congress on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Barcelona, ...
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can ...
Genetic programming (GP) is an evolutionary computation technique to solve problems in an automated,...