16093 search results - page 385 / 3219 » On the optimality of the neighbor-joining algorithm |
177
click to vote
GECCO
2003
Springer
16 years 3 days ago
2003
Springer
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. ...
172
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
219
click to vote
GPEM
2002
15 years 6 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
180
click to vote
TIP
1998
15 years 6 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
235
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...