602 search results - page 36 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
69
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
GECCO
2010
Springer
15 years 29 days ago
2010
Springer
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
GECCO
1999
Springer
15 years 1 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...
ESWA
2006
14 years 9 months ago
2006
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...