3934 search results - page 312 / 787 » Approximate Schedulability Analysis |
152
click to vote
SLP
1997
15 years 8 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
167
click to vote
QUESTA
2006
15 years 6 months ago
2006
The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute t...
167
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
The paper considers making inferences about the underlying true 2-D motion when only evaluations of a local block-based cost function, the mean of absolute or squared differences,...
173
click to vote
FORMATS
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we report some progress in applying timed automata technology to large-scale problems. We focus on the problem of finding maximal stabilization time for combinationa...
138
click to vote
APSEC
2000
IEEE
15 years 11 months ago
2000
IEEE
Many program maintenance tools rely on traditional parsing techniques to obtain syntactic level models of the code being maintained. When, for some reason, code cannot be parsed, ...