844 search results - page 11 / 169 » Generalized crowding for genetic algorithms |
JIFS
2002
14 years 9 months ago
2002
This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
ITICSE
1997
ACM
15 years 1 months ago
1997
ACM
The field of Genetic Algorithms has grown into a huge area over the last few years. Genetic Algorithms are adaptive methods, which can be used to solve search and optimisation pro...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a variety of different ways of estimating the general parameters for pump-curves. First a formulation is made that converts the problem into estimating four p...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...