Sciweavers

1532 search results - page 5 / 307
» A Comparison of RESTART Implementations
Sort
View
SIGOPS
2008
90views more  SIGOPS 2008»
13 years 7 months ago
Virtual servers and checkpoint/restart in mainstream Linux
Virtual private servers and application checkpoint and restart are two advanced operating system features which place different but related requirements on the way kernel-provided...
Sukadev Bhattiprolu, Eric W. Biederman, Serge E. H...
ICML
2008
IEEE
14 years 8 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
IJCAI
2003
13 years 8 months ago
Understanding the Power of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 4 days 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
194views Optimization» more  GECCO 2010»
13 years 11 months ago
Mirrored variants of the (1, 2)-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 f...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen