4 search results - page 1 / 1 » Tightening the Bounds on Feasible Preemption Points |
RTSS
2006
IEEE
13 years 10 months ago
2006
IEEE
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
TECS
2010
12 years 11 months ago
2010
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
OL
2008
13 years 4 months ago
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...