Sciweavers

3333 search results - page 227 / 667
» Optimal Power-Down Strategies
Sort
View
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
15 years 11 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
Raymond Ros
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
15 years 11 months ago
Benchmarking sep-CMA-ES on the BBOB-2009 function testbed
A partly time and space linear CMA-ES is benchmarked on the BBOB-2009 noiseless function testbed. This algorithm with a multistart strategy with increasing population size solves ...
Raymond Ros
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 8 months ago
Approximate dynamic programming for rail operations
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Warren B. Powell, Belgacem Bouzaïene-Ayari
CEC
2007
IEEE
16 years 29 days ago
Clonal particle swarm optimization and its applications
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...
Y. Tan, Z. M. Xiao
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 10 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu