2485 search results - page 133 / 497 » Time Bounded Frequency Computations |
157
Voted
ENTCS
2008
15 years 5 months ago
2008
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
230
click to vote
ISOLA
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
157
click to vote
VLSID
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper, we describe two new algorithms for datapath scheduling which aim at energy reduction while maintaining performance. The proposed algorithms, time constrained and re...
164
click to vote
RTSS
2009
IEEE
15 years 11 months ago
2009
IEEE
—Memory accesses form an important source of timing unpredictability. Timing analysis of real-time embedded software thus requires bounding the time for memory accesses. Multipro...
134
click to vote
CONCUR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...