602 search results - page 40 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
TSMC
2008
14 years 9 months ago
2008
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
105
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes the development of an evolutionary algorithm called Multipopulation Cooperative Coevolutionary Programming (MCCP) that extends Genetic Programming (GP) to sea...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Elitism is commonly used in generational GP to ensure that the best individuals discovered in a generation are not lost, and are made available for possible further improvements t...
EVOW
2004
Springer
15 years 1 months ago
2004
Springer
A number of bioinformatics tools use regular expression (RE) matching to locate protein or DNA sequence motifs that have been discovered by researchers in the laboratory. For exam...