Sciweavers

5230 search results - page 138 / 1046
» Dynamic Optimality -- Almost
Sort
View
137
Voted
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 7 months ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...
121
Voted
DISOPT
2006
90views more  DISOPT 2006»
15 years 3 months ago
Tree decompositions of graphs: Saving memory in dynamic programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
124
Voted
EOR
2007
123views more  EOR 2007»
15 years 3 months ago
Dynamic programming analysis of the TV game "Who wants to be a millionaire?"
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionai...
Federico Perea, Justo Puerto
137
Voted
CSREAESA
2006
15 years 5 months ago
Energy Optimization for Application-Specific NOC with Multi-Mode Switches
As the number of cores on a chip increases, power consumed by the communication structures takes significant portion of the overall power-budget. As technology scales to deep sub-...
Kuei-Chung Chang
128
Voted
ATMOS
2007
177views Optimization» more  ATMOS 2007»
15 years 5 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