Sciweavers

3049 search results - page 439 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
GECCO
2010
Springer
135views Optimization» more  GECCO 2010»
15 years 6 months ago
Investigating the impact of sequential selection in the (1, 2)-CMA-ES on the noisy BBOB-2010 testbed
Sequential selection was introduced for Evolution Strategies (ESs) with the aim of accelerating their convergence— performing the evaluations of the different offspring sequen...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
PAMI
2008
160views more  PAMI 2008»
15 years 4 months ago
Parametric Image Alignment Using Enhanced Correlation Coefficient Maximization
In this work, we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the ...
Georgios D. Evangelidis, Emmanouil Z. Psarakis
SIAMIS
2010
190views more  SIAMIS 2010»
14 years 11 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
16 years 1 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
CPAIOR
2007
Springer
15 years 10 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter