20 search results - page 3 / 4 » Limiting Behavior of Markov Chains with Eager Attractors |
CDC
2008
IEEE
14 years 7 days ago
2008
IEEE
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
DSD
2002
IEEE
13 years 10 months ago
2002
IEEE
In this paper we introduce concepts of a potential fault latency and a real fault latency for Finite State Machines (FSMs). The potential latency defines a minimal value of the po...
ISLPED
1998
ACM
13 years 10 months ago
1998
ACM
- The objective of this paper is to provide lower and upper bounds for the switching activity on the state lines in Finite State Machines (FSMs). Using a Markov chain model for the...
AINA
2008
IEEE
14 years 7 days ago
2008
IEEE
Data transmission over wireless networks is challenging due to the occurrence of burst errors, and packet loss caused by such errors seriously limits the maximum achievable throug...
SPAA
1990
ACM
13 years 9 months ago
1990
ACM
Multithreading has been proposed as an architectural strategy for tolerating latency in multiprocessors and, through limited empirical studies, shown to offer promise. This paper ...