466 search results - page 12 / 94 » A Worst Case Timing Analysis Technique for Optimized Program... |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Safety-criticalembeddedsystems having to meet real-time constraints are to be highlypredictable in order to guarantee at design time that certain timing deadlines will always be m...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
MP
2007
13 years 8 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
ITC
2000
IEEE
14 years 25 days ago
2000
IEEE
A deterministic partitioning technique for fault diagnosis in Scan-Based BIST is proposed. Properties of high quality partitions for improved fault diagnosis times are identified...
IWMM
2007
Springer
14 years 2 months ago
2007
Springer
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...