435 search results - page 56 / 87 » Timing analysis of asynchronous circuits using timed automat... |
88
Voted
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper presents a general method for computing transient sensitivities using both the direct and adjoint methods in event driven controlled explicit simulation algorithms that...
102
click to vote
QEST
2008
IEEE
15 years 6 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
105
Voted
UAI
1996
15 years 1 months ago
1996
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
189
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
102
Voted
VTS
2003
IEEE
15 years 5 months ago
2003
IEEE
: This paper presents a novel, low cost technique based on implications to identify untestable bridging faults in sequential circuits. Sequential symbolic simulation [1] is first p...