118 search results - page 10 / 24 » Fitness Clouds and Problem Hardness in Genetic Programming |
GECCO
1999
Springer
13 years 12 months ago
1999
Springer
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
Programming distributed data-intensive web and mobile applications is gratuitously hard. As the world is moving more and more towards the software as services model, we have to co...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This poster paper investigates the potential of single and multiobjective genetic operators with an object-oriented conceptual design space. Using cohesion as an objective fitness...
EUROGP
2003
Springer
14 years 28 days ago
2003
Springer
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...