10909 search results - page 555 / 2182 » Evaluating Backup Algorithms |
169
Voted
GECCO
2004
Springer
16 years 13 days ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
169
Voted
DEXA
2003
Springer
16 years 8 days ago
2003
Springer
In this paper, we present a group pattern mining approach to derive the grouping information of mobile device users based on the spatio-temporal distances among them. Group pattern...
183
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
173
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
194
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...