8540 search results - page 103 / 1708 » The Dynamic Servers Problem |
HOTSWUP
2009
ACM
15 years 2 months ago
2009
ACM
We consider the state mapping problem for dynamic software updates and propose a number of approaches that have the potential of automating the state mapping in practical setting....
NETWORKS
2008
14 years 10 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
ATMOS
2008
14 years 11 months ago
2008
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...