74 search results - page 4 / 15 » Efficiently evolving programs through the search for novelty |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Particle Swarm Optimisation (PSO) uses a population of particles that fly over the fitness landscape in search of an optimal solution. The particles are controlled by forces tha...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
EPS
1997
Springer
13 years 11 months ago
1997
Springer
Genetic Programming is increasing in popularity as the basis for a wide range of learning algorithms. However, the technique has to date only been successfully applied to modest t...