339 search results - page 50 / 68 » Random Sampling Techniques in Parallel Computation |
ASPDAC
2006
ACM
15 years 1 months ago
2006
ACM
The verification of modern computing systems has grown to dominate the cost of system design, often with limited success as designs continue to be released with latent bugs. This t...
77
Voted
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
CGF
2010
14 years 9 months ago
2010
We present a new algorithm for efficient rendering of high-quality depth-of-field (DoF) effects. We start with a single rasterized view (reference view) of the scene, and sample t...
SIGGRAPH
1994
ACM
15 years 1 months ago
1994
ACM
The use of double-buffered displays, in which the previous image is displayed until the next image is complete, can impair the interactivity of systems that require tight coupling...
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...