✦ LIBER ✦

The congenial talking philosophers problem in computer networks

✍ Scribed by Yuh-Jzer Joung

Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 702 KB
Volume: 15
Category: Article
ISSN: 0178-2770
DOI: 10.1007/s004460100069

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the capacity assignment problem in pa

On the capacity assignment problem in packet-switching computer networks

✍ E.D. Sykas 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 903 KB

Optimization problems in computer networ

Optimization problems in computer network design

✍ S.I Samoylenko 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 773 KB

The stability problem of broadcast packe

The stability problem of broadcast packet switching computer networks

✍ G. Fayolle; E. Gelenbe; J. Labetoulle; D. Bastin 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 268 KB

The optimal network problem: some comput

The optimal network problem: some computational procedures

📂 Article 📅 1969 🏛 Elsevier Science ⚖ 88 KB

The optimal network problem: Some comput

The optimal network problem: Some computational procedures

✍ Allen J. Scott 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 774 KB

Problems in using computers for planning

Problems in using computers for planning telecommunications networks

✍ I.F. Galpin 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Telecommunications networks possess special properties which make it difficult to use standard network analysis techniques: for example, Kirchhoff's Laws do not apply. Some of the problems arising are discussed with reference to the planning of the network of cables and radio links interconnecting t