602 search results - page 30 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
CEC
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract-- A key indicator of problem difficulty in evolutionary computation problems is the landscape's locality, that is whether the genotype-phenotype mapping preserves nei...
CEC
2009
IEEE
15 years 4 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
106
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
82
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper introduces a new approach to develop a fast gait for quadruped robot using genetic programming (GP). Several recent approaches have focused on the genetic algorithm (GA...