✦ LIBER ✦

Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks

✍ Scribed by Keqin Li

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 230 KB
Volume: 60
Category: Article
ISSN: 0166-5316
DOI: 10.1016/j.peva.2004.10.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance analysis and design of optim

Performance analysis and design of optimized static random access memory (SRAM)

✍ Jahangir Dewan; Baher S. Haroun; Asim J. Al-khalili 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Performance evaluation of a random-walk-

Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks

✍ Keqin Li 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views

Topics in computer-aided design: Part II

Topics in computer-aided design: Part II. Synthesis of optimal heat exchanger networks by tree searching algorithms

✍ T. K. Pho; L. Lapidus 📂 Article 📅 1973 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 879 KB

Analysis and design of AIMD congestion c

Analysis and design of AIMD congestion control algorithms in communication networks

✍ R.N. Shorten; D.J. Leith; J. Foy; R. Kilduff 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Combinatorial optimization problems in t

Combinatorial optimization problems in the analysis and design of probabilistic networks

✍ D. Bauer; F. Boesch; C. Suffel; R. Tindell 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

This paper presents some results regarding the design of reliable networks. The problem under consideration involves networks which are undirected graphs having equal and independent edge failure probabilities. The index of reliability is the probability that the network fails (becomes disconnected)

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce