466 search results - page 70 / 94 » A Worst Case Timing Analysis Technique for Optimized Program... |
PE
2002
Springer
13 years 8 months ago
2002
Springer
: We analyze D/G/1 and M/G/1 queues where the service time for an arrival depends on the amount of work in the system upon arrival. The models are motivated by the bit dropping met...
DSN
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper concerns the validity of a widely used method for estimating the architecture-level mean time to failure (MTTF) due to soft errors. The method first calculates the fai...
CC
2011
Springer
13 years 2 days ago
2011
Springer
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
CSMR
2007
IEEE
14 years 2 months ago
2007
IEEE
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...