✦ LIBER ✦

Probabilistic quickest path algorithm

✍ Scribed by Nageswara S.V. Rao

Book ID: 108280890
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 319 KB
Volume: 312
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.08.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for the quickest path problem

Algorithms for the quickest path problem and the reliable quickest path problem

✍ Herminia I. Calvete; Lourdes del-Pozo; José A. Iranzo 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 260 KB

Algorithms for the quickest path problem

Algorithms for the quickest path problem and the enumeration of quickest paths

✍ J.B. Rosen; S.-Z. Sun; G.-L. Xue 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 644 KB

On update algorithms for quickest paths

✍ Y.C Bang; S Radhakrishnan; N.S.V Rao; S.G Batsell 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 116 KB

The quickest path problem deals with the transmission of a message of size s from a source to a destination with the minimum end-to-end delay over a network with bandwidth and delay constraints on the links. The path-table that maps all intervals for s to the corresponding quickest paths can be comp

Algorithms for the constrained quickest

Algorithms for the constrained quickest path problem and the enumeration of quickest paths

✍ Chen Gen-Huey; Hung Yung-Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Distributed algorithms for the quickest

Distributed algorithms for the quickest path problem

✍ Yung-Chen Hung; Gen-Huey Chen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 955 KB

The quickest path problem

✍ Y.L. Chen; Y.H. Chin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 822 KB