16188 search results - page 342 / 3238 » The Optimal PAC Algorithm |
190
click to vote
CGO
2006
IEEE
16 years 24 days ago
2006
IEEE
Although compile-time optimizations generally improve program performance, degradations caused by individual techniques are to be expected. One promising research direction to ove...
172
click to vote
GECCO
2003
Springer
15 years 12 months 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. ...
165
click to vote
GECCO
2008
Springer
15 years 7 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...
212
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...
178
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...