602 search results - page 10 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
EPS
1995
Springer
14 years 1 months ago
1995
Springer
: This paper describes six new architecture-altering operations that provide a way to dynamically determine the architecture of a multipart program during a run of genetic programm...
ANNPR
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
14 years 3 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
FLAIRS
2006
13 years 11 months ago
2006
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...