The aim of this paper is to study the global reliability of communication networks. We assume that, in a communication network, the weights of the edges quantify the volume or the quality of the information transmitted by the nodes. In such a case, the strength of a path (resp. walk), called the rel
β¦ LIBER β¦
On the realization of reliability functions of probabilistic communication networks
β Scribed by Shu -Gar Chan; Yumin Fu; S. Park Chan
- Book ID
- 105231962
- Publisher
- Springer
- Year
- 1968
- Tongue
- English
- Weight
- 717 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0022-0833
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On reliability indices of communication
β
Juan Alberto RodrΓguez-VelΓ‘zquez; Aida KamiΕ‘aliΔ; Josep Domingo-Ferrer
π
Article
π
2009
π
Elsevier Science
π
English
β 461 KB
On the reliability of biconnected networ
β
Z. Khalil
π
Article
π
1983
π
Elsevier Science
π
English
β 234 KB
On the design of reliable networks
β
S. L. Hakimi; A. T. Amin
π
Article
π
1973
π
John Wiley and Sons
π
English
β 771 KB
Modified probabilistic neural network co
β
Doo Kie Kim; Dong Hyawn Kim; Seong Kyu Chang; Sang Kil Chang
π
Article
π
2007
π
Korean Society of Civil Engineers
π
English
β 511 KB
On the realizability of pair correlation
β
O.U. Uche; F.H. Stillinger; S. Torquato
π
Article
π
2006
π
Elsevier Science
π
English
β 276 KB
The pair correlation function g 2 Γ°rΓ provides a basic geometric descriptor for many-particle systems. It must obey two necessary conditions: (i) non-negativity for all distances r, and (ii) non-negativity of its associated structure factor SΓ°kΓ for all k. Here we utilize an improved stochastic cons
Some notes on the probabilistic semantic
β
Todd R. Davies
π
Article
π
1988
π
Elsevier Science
π
English
β 104 KB