✦ LIBER ✦

Shortest distance and reliability of probabilistic networks

✍ Scribed by Pitu B. Mirchandani

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 883 KB
Volume: 3
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(76)90017-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On shortest two-connected Steiner networ

On shortest two-connected Steiner networks with Euclidean distance

✍ Hsu, D. Frank; Hu, Xiao-Dong 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

In this paper, we consider the problem of constructing the shortest two-connected Steiner network on the Euclidean plane. For a given set P of points on the Euclidean plane, let l 2 (P) denote the length of the shortest two-connected Steiner network on P divided by the length of the shortest two-con

n-Cube network: node disjoint shortest p

n-Cube network: node disjoint shortest paths for maximal distance pairs of vertices

✍ Teofilo F. Gonzalez; David Serena 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 354 KB

The β-reliable minimax and maximin locat

The β-reliable minimax and maximin location problems on a network with probabilistic weights

✍ Jiamin Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

Reliability and communications networks

✍ Anil P. Macwan; Robert S. Hanmer; Kailash K. Mutha 📂 Article 📅 2006 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 172 KB

Optimal routing in shortest-path data ne

Optimal routing in shortest-path data networks

✍ K. G. Ramakrishnan; Manoel A. Rodrigues 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 249 KB 👁 1 views

Segmentation of merged characters by neu

Segmentation of merged characters by neural networks and shortest path

✍ Jin Wang; Jack Jean 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 822 KB