129 search results - page 23 / 26 » Optimal solutions for moving target search |
BMCBI
2006
13 years 8 months ago
2006
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
GECCO
2010
Springer
2010
Springer
Investigating the impact of sequential selection in the (1, 4)-CMA-ES on the noisy BBOB-2010 testbed
13 years 10 months ago
Sequential selection, introduced for Evolution Strategies (ESs) with the aim of accelerating their convergence, consists in performing the evaluations of the different offspring...
ALGORITHMICA
2006
13 years 8 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
ASPLOS
1998
ACM
14 years 20 days ago
1998
ACM
Optimizations aimed at reducing the impact of memory operations on execution speed have long concentrated on improving cache performance. These efforts achieve a reasonable level...