๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Meeting the deadline: on the complexity of fault-tolerant continuous gossip

โœ Scribed by Chryssis Georgiou; Seth Gilbert; Dariusz R. Kowalski

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
383 KB
Volume
24
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Construction of Fault-Tolerant Cu
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks
โœ J. Bruck; R. Cypher; C.T. Ho ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 772 KB

This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole

On the metric complexity of continuous-t
On the metric complexity of continuous-time systems
โœ Le Yi Wang; Lin Lin ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 531 KB

In this paper, metric complexities of certain classes of continuous-time systems are studied, using the time-domain sampling approach and the concepts of Kolmogorov, Gel'fand and sampling n-widths for certain classes of Sobolev space. A sampling theorem is obtained which extends Shannon's sampling t