Sciweavers

2129 search results - page 124 / 426
» Cutting-Edge Timing Analysis Techniques
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
LCTRTS
2000
Springer
15 years 1 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
SENSYS
2009
ACM
15 years 4 months ago
Run time assurance of application-level requirements in wireless sensor networks
Continuous and reliable operation of WSNs is notoriously difficult to guarantee due to hardware degradation and environmental changes. In this paper, we propose and demonstrate a ...
Jingyuan Li, Yafeng Wu, Krasimira Kapitanova, John...
EVOW
2005
Springer
15 years 3 months ago
Order Preserving Clustering over Multiple Time Course Experiments
Abstract. Clustering still represents the most commonly used technique to analyze gene expression data—be it classical clustering approaches that aim at finding biologically rel...
Stefan Bleuler, Eckart Zitzler
ECRTS
2006
IEEE
15 years 4 months ago
WCET-Centric Software-controlled Instruction Caches for Hard Real-Time Systems
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
Isabelle Puaut