55 search results - page 3 / 11 » Optimal Sampling and Speed-Up for Genetic Algorithms on the ... |
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
FSS
2010
13 years 6 months ago
2010
Fuzzy Cognitive Maps (FCMs) are a convenient tool for modeling and simulating dynamic systems. FCMs were applied in a large number of diverse areas and have already gained momentu...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
Estimation of distribution algorithms (EDA) are similar to genetic algorithms except that they replace crossover and mutation with sampling from an estimated probability distributi...
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
Tournament selection is a popular form of selection which is commonly used with genetic algorithms, genetic programming and evolutionary programming. However, tournament selection...