64 search results - page 11 / 13 » Adaptive Overrelaxed Bound Optimization Methods |
TACAS
2005
Springer
14 years 2 months ago
2005
Springer
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
DATE
2010
IEEE
14 years 1 months ago
2010
IEEE
—The growing trend towards using component based design approach in embedded system development requires addressing newer system engineering challenges. These systems are usually...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Energy use of computer communication systems has quickly become a vital design consideration. One effective method for reducing energy consumption is dynamic speed scaling, whic...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...