535 search results - page 74 / 107 » Checking Computations in Polylogarithmic Time |
CGF
1999
13 years 7 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
ACSD
2007
IEEE
14 years 2 months ago
2007
IEEE
We study sensor minimization problems in the context of fault diagnosis. Fault diagnosis consists in synthesizing a diagnoser that observes a given plant and identifies faults in...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Real-time systems using Rate Monotonic fixed priority scheduling can be checked for schedulability either by pessimistic schedulability conditions or exact testing. Exact testing ...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
CC
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...