3049 search results - page 147 / 610 » On the Convergence of Bound Optimization Algorithms |
143
Voted
CPM
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
134
click to vote
NIPS
2008
15 years 6 months ago
2008
We provide a new analysis of an efficient margin-based algorithm for selective sampling in classification problems. Using the so-called Tsybakov low noise condition to parametrize...
132
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
111
click to vote
IPCO
1996
15 years 6 months ago
1996
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
147
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents a gregarious particle swarm optimization algorithm (G-PSO) in which the particles explore the search space by aggressively scouting the local minima with the h...