Sciweavers

1147 search results - page 20 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
SPIN
2010
Springer
13 years 6 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 8 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
CCGRID
2006
IEEE
14 years 1 months ago
Statistical Properties of Task Running Times in a Global-Scale Grid Environment
— Over the years, the use of global grid environments have become widespread. In order to make applications robust against the dynamics of those grid environments it is essential...
Menno Dobber, Robert D. van der Mei, Ger Koole
VTS
2006
IEEE
93views Hardware» more  VTS 2006»
14 years 1 months ago
Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
Vishwani D. Agrawal, Soumitra Bose, Vijay Gangaram
DAC
2006
ACM
14 years 8 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...