8540 search results - page 227 / 1708 » The Dynamic Servers Problem |
128
click to vote
WAE
2000
15 years 4 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
156
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
120
Voted
DISOPT
2006
15 years 3 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
211
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
We present a collaborative, self-configuring high availability (HA) approach for stream processing that enables low-latency failure recovery while incurring small run-time overhea...
110
click to vote
HPCA
2008
IEEE
16 years 3 months ago
2008
IEEE
Power control is becoming a key challenge for effectively operating a modern data center. In addition to reducing operating costs, precisely controlling power consumption is an es...