Sciweavers

312 search results - page 14 / 63
» Concurrent Analysis Techniques for Data Path Timing Optimiza...
Sort
View
CPAIOR
2007
Springer
15 years 5 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
RTSS
2005
IEEE
15 years 4 months ago
WCET Centric Data Allocation to Scratchpad Memory
Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to p...
Vivy Suhendra, Tulika Mitra, Abhik Roychoudhury, T...
ECRTS
2002
IEEE
15 years 4 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
AAAI
2007
15 years 1 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
ETT
2002
77views Education» more  ETT 2002»
14 years 11 months ago
On the importance function in splitting simulation
The splitting method is a simulation technique for the estimation of very small probabilities. In this technique, the sample paths are split into multiple copies, at various stages...
Marnix J. J. Garvels, Jan-Kees C. W. van Ommeren, ...