Sciweavers

1485 search results - page 212 / 297
» Whole Program Paths
Sort
View
IMA
2005
Springer
127views Cryptology» more  IMA 2005»
14 years 2 months ago
On the Automatic Construction of Indistinguishable Operations
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
Manuel Barbosa, Dan Page
EUROPAR
2004
Springer
14 years 2 months ago
Architecture-Independent Meta-optimization by Aggressive Tail Splitting
Several optimization techniques are hindered by uncertainties about the control flow in a program, which can generally not be determined by static methods at compile time. We pres...
Michael Rock, Andreas Koch
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 2 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
14 years 2 months ago
A Hop Constrained Min-Sum Arborescence with Outage Costs
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
Rakesh Kawatra
IEEEPACT
2003
IEEE
14 years 2 months ago
Y-Branches: When You Come to a Fork in the Road, Take It
In this paper, we study the effects of manipulating the architected direction of conditional branches. Through the use of statistical sampling, we find that about 40% of all dyna...
Nicholas J. Wang, Michael Fertig, Sanjay J. Patel