𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks

✍ Scribed by S. Even; S. Rajsbaum

Publisher
Springer
Year
1997
Tongue
English
Weight
230 KB
Volume
30
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing the probability distribution o
Computing the probability distribution of project duration in a PERT network
✍ Jane N. Hagstrom πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 748 KB

The algorithm presented here makes exact computations of characteristics of the probability distribution of project duration for a stochastic project network. Given discrete independent probability distributions for task durations, the algorithm will compute either moments of the project duration di

The number of edges in a maximum cycleβ€”d
The number of edges in a maximum cycleβ€”distributed graph
✍ Yongbing Shi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 288 KB

Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(