Sciweavers

5230 search results - page 423 / 1046
» Dynamic Optimality -- Almost
Sort
View
CF
2007
ACM
15 years 9 months ago
Computational and storage power optimizations for the O-GEHL branch predictor
In recent years, highly accurate branch predictors have been proposed primarily for high performance processors. Unfortunately such predictors are extremely energy consuming and i...
Kaveh Aasaraai, Amirali Baniasadi, Ehsan Atoofian
CPAIOR
2008
Springer
15 years 9 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
SERVICES
2010
166views more  SERVICES 2010»
15 years 9 months ago
Context-Driven Optimization of Mobile Service-Oriented Systems for Improving Their Resilience
Mobile software systems are characterized by their highly dynamic and unpredictable execution context. Such systems are permeating a number of domains where the systems operate in ...
Deshan Cooray, Sam Malek, Roshanak Roshandel
IJCAI
2007
15 years 9 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
EOR
2008
83views more  EOR 2008»
15 years 7 months ago
Rerouting tunnels for MPLS network resource optimization
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
Olivier Klopfenstein