256 search results - page 8 / 52 » Approximation of the worst-case execution time using structu... |
ICCSA
2004
Springer
14 years 1 months ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
ICCD
2007
IEEE
14 years 5 months ago
2007
IEEE
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
RTS
2008
13 years 8 months ago
2008
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
CSREAESA
2008
13 years 10 months ago
2008
This paper discusses why the extensive scientific results on predicting embedded systems temporal behavior never, or very seldom, reaches the industrial community. We also point ou...
ADHOCNOW
2004
Springer
14 years 2 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...