Sciweavers

1291 search results - page 191 / 259
» Arithmetic program paths
Sort
View
85
Voted
ICALT
2005
IEEE
15 years 6 months ago
Java Learning Object Ontology
This paper presents an ontology, the Java Learning Object Ontology - JLOO, for organizing learning objects of Java courses in an adaptive e-learning environment. The classificatio...
Ming-Che Lee, Ding Yen Ye, Tzone I. Wang
111
Voted
IMA
2005
Springer
127views Cryptology» more  IMA 2005»
15 years 6 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
95
Voted
EUROPAR
2004
Springer
15 years 6 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»
15 years 6 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 ...
82
Voted
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
15 years 6 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