Sciweavers

1529 search results - page 86 / 306
» On Timing Analysis of Combinational Circuits
Sort
View
DAC
1994
ACM
15 years 1 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
DAC
1998
ACM
15 years 2 months ago
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device model...
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov
DAC
2006
ACM
15 years 10 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
ICASSP
2011
IEEE
14 years 1 months ago
Multistream speaker diarization through Information Bottleneck system outputs combination
Speaker diarization of meetings recorded with Multiple Distant Microphones makes extensive use of multiple feature streams like MFCC and Time Delay of Arrivals (TDOA). Typically t...
Deepu Vijayasenan, Fabio Valente, Petr Motlí...
CSCLP
2005
Springer
15 years 3 months ago
Complexity Analysis of Heuristic CSP Search Algorithms
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
Igor Razgon