Sciweavers

2994 search results - page 240 / 599
» Time sequences
Sort
View
164
Voted
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 8 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
RTS
2006
129views more  RTS 2006»
15 years 4 months ago
Modeling out-of-order processors for WCET analysis
Estimating the Worst Case Execution Time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typic...
Xianfeng Li, Abhik Roychoudhury, Tulika Mitra
IPPS
2010
IEEE
15 years 2 months ago
Overlapping computation and communication: Barrier algorithms and ConnectX-2 CORE-Direct capabilities
Abstract--This paper explores the computation and communication overlap capabilities enabled by the new CORE-Direct hardware capabilities introduced in the InfiniBand (IB) Host Cha...
Richard L. Graham, Stephen W. Poole, Pavel Shamis,...
EWRL
2008
15 years 6 months ago
Optimistic Planning of Deterministic Systems
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
Jean-François Hren, Rémi Munos
118
Voted
CHI
2009
ACM
16 years 5 months ago
Using temporal patterns (t-patterns) to derive stress factors of routine tasks
We describe the use of a statistical technique called Tpattern analysis to derive and characterize the routineness of tasks. T-patterns provide significant advantages over traditi...
Oliver Brdiczka, Norman Makoto Su, Bo Begole