313 search results - page 22 / 63 » Computing synchronizer failure probabilities |
132
Voted
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
137
Voted
TON
2010
15 years 1 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
137
Voted
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we will examine two main aspects of trust dynamics: a) How direct experiences involving trust, with their successes or failures, influence the future trust of an age...
112
click to vote
TKDE
1998
15 years 2 months ago
1998
-- We estimate the availability, reliability, and mean transaction time (response time) for repairable database configurations, centralized or distributed, in which each service co...
151
Voted
ICDCS
2011
IEEE
14 years 2 months ago
2011
IEEE
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...