✦ LIBER ✦

Maximum finding on a multiple access broadcast network

✍ Scribed by Charles U. Martel

Book ID: 107766241
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 648 KB
Volume: 52
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)90133-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast maximum finding algorithm on broa

A fast maximum finding algorithm on broadcast communication

✍ Shiau Shyue-Horng; Chang-Biau Yang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 579 KB

Broadcasting Spanning Forests on a Multi

Broadcasting Spanning Forests on a Multiple-Access Channel

✍ Bogdan S. Chlebus; Karol Golab; Dariusz R. Kowalski 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 282 KB

On the transport capacity of Gaussian mu

On the transport capacity of Gaussian multiple access and broadcast channels

✍ G. A. Gupta; S. Toumpis; J. Sayir; R. R. Müller 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 670 KB

A neural network model for finding a nea

A neural network model for finding a near-maximum clique

✍ Nubuo Funabiki; Yoshiyasu Takefuji; Kuo-Chun Lee 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 397 KB

A parallel algorithm based on the neural network model for finding a near-maximum clique is presented in this paper. A maximum clique of a graph G is a maximum complete subgraph of G where any two vertices are adjacent. The problem of finding a maximum clique is NP-complete. The parallel algorithm r

Broadcast service implementation on a pa

Broadcast service implementation on a packet-switched network

✍ Ken Weaving 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 563 KB

A note on finding a maximum empty rectan

A note on finding a maximum empty rectangle

✍ Mikhail J Atallah; Greg N Frederickson 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 281 KB