Sciweavers

16188 search results - page 221 / 3238
» The Optimal PAC Algorithm
Sort
View
EC
2007
167views ECommerce» more  EC 2007»
15 years 6 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
CEC
2009
IEEE
16 years 1 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang
EMO
2005
Springer
110views Optimization» more  EMO 2005»
15 years 12 months ago
Parallelization of Multi-objective Evolutionary Algorithms Using Clustering Algorithms
Abstract. While Single-Objective Evolutionary Algorithms (EAs) parallelization schemes are both well established and easy to implement, this is not the case for Multi-Objective Evo...
Felix Streichert, Holger Ulmer, Andreas Zell
GECCO
2010
Springer
347views Optimization» more  GECCO 2010»
15 years 8 months ago
Comparison of cauchy EDA and BIPOP-CMA-ES algorithms on the BBOB noiseless testbed
Estimation-of-distribution algorithm using Cauchy sampling distribution is compared with the bi-population CMA evolutionary strategy which was one of the best contenders in the bl...
Petr Posík
IJCV
2012
13 years 8 months ago
Sparse Occlusion Detection with Optical Flow
Abstract We tackle the problem of detecting occluded regions in a video stream. Under assumptions of Lambertian reflection and static illumination, the task can be posed as a vari...
Alper Ayvaci, Michalis Raptis, Stefano Soatto