8016 search results - page 100 / 1604 » On the practical genetic algorithms |
190
click to vote
NIPS
2004
15 years 7 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
191
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
193
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
157
click to vote
GECCO
2009
Springer
16 years 27 days ago
2009
Springer
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
172
click to vote
GECCO
2009
Springer
16 years 27 days ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...