✦ LIBER ✦

Optimum split trees

✍ Scribed by Yehoshua Perl

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 446 KB
Volume: 5
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(84)90017-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal binary split trees

✍ Shou-Hsuan Stephen Huang; C.K Wong 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Optimal multiway split trees

✍ Shou-Hsuan Stephen Huang 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 533 KB

Optimum design of serial measurement tre

Optimum design of serial measurement trees

✍ Robert Ahlbrandt; Hari K. Iyer; Dominic F. Vecchia 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 535 KB

Faster construction of optimal binary sp

Faster construction of optimal binary split trees

✍ J.H Hester; D.S Hirschberg; S.-H.S Huang; C.K Wong 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 714 KB

Optimum requirement spanning trees and r

Optimum requirement spanning trees and reliability of tree networks

✍ Anazawa, Tsutomu; Kodera, Takayuki; Jimbo, Masakazu 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this paper, an explicit solution of the optimum requirement spanning tree (ORST), studied by Hu, is obtained in the case when a weight is assigned to each node and when maximum-degree conditions are given. Further, the solution is shown to minimize the probability of communication failure in the

An adaptive split policy for the Time Sp

An adaptive split policy for the Time Split B-Tree

✍ Laura Amadesi; Fabio Grandi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 863 KB