602 search results - page 3 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
GECCO
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
IPPS
1999
IEEE
14 years 25 days ago
1999
IEEE
Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
ICANNGA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing...
EUROGP
2007
Springer
14 years 2 months ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...