Sciweavers

200 search results - page 30 / 40
» On the decidability of phase ordering problem in optimizing ...
Sort
View
RTS
2000
143views more  RTS 2000»
13 years 7 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
NIPS
1997
13 years 8 months ago
Learning to Schedule Straight-Line Code
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...
J. Eliot B. Moss, Paul E. Utgoff, John Cavazos, Do...
FOCS
2008
IEEE
14 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
LCTRTS
2001
Springer
13 years 12 months ago
ILP-based Instruction Scheduling for IA-64
The IA-64 architecture has been designed as a synthesis of VLIW and superscalar design principles. It incorporates typical functionality known from embedded processors as multiply...
Daniel Kästner, Sebastian Winkel
EOR
2007
69views more  EOR 2007»
13 years 7 months ago
Incorporating inventory and routing costs in strategic location models
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
Zuo-Jun Max Shen, Lian Qi