Sciweavers

849 search results - page 56 / 170
» The Early Restart Algorithm
Sort
View
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 6 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
ICS
2004
Tsinghua U.
15 years 11 months ago
Adaptive incremental checkpointing for massively parallel systems
Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in the...
Saurabh Agarwal, Rahul Garg, Meeta Sharma Gupta, J...
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
15 years 11 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noisy BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)and (1 + 2)-Evolution-Strategies (ESs) with the aim of designing fa...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
GECCO
2010
Springer
237views Optimization» more  GECCO 2010»
15 years 11 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noiseless BBOB-2010 testbed
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD ....
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 10 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noisy BBOB-2010 testbed
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD . Recently, ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen