2084 search results - page 129 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
123
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
142
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
122
click to vote
AAAI
2007
15 years 7 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
129
Voted
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
153
click to vote
DAC
1994
ACM
15 years 9 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...