256 search results - page 11 / 52 » Approximation of the worst-case execution time using structu... |
179
Voted
PODS
2009
ACM
16 years 6 days ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
83
Voted
SAS
1999
Springer
15 years 3 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
ESA
2000
Springer
15 years 3 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
74
Voted
WCET
2008
15 years 1 months ago
2008
We have developed a new programming paradigm which, for conforming programs, allows the averagecase execution time (ACET) to be obtained automatically by a static analysis. This i...
DAC
2005
ACM
16 years 19 days ago
2005
ACM
Existing Full-wave Model Order Reduction (FMOR) approaches are based on Expanded Taylor Series Approximations (ETAS) of the oscillatory full-wave system matrix. The accuracy of su...