✦ LIBER ✦

Searching for an optimal path in a tree with random costs

✍ Scribed by Richard M. Karp; Judea Pearl

Book ID: 108307005
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 690 KB
Volume: 21
Category: Article
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(83)80006-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal binary search trees with costs d

Optimal binary search trees with costs depending on the access paths

✍ Jayme L. Szwarcfiter; Gonzalo Navarro; Ricardo Baeza-Yates; Joı&#x0301;sa de 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 169 KB

An optimal algorithm for the maximum-den

An optimal algorithm for the maximum-density path in a tree

✍ Bang Ye Wu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 159 KB

An optimal bound for path weights in Huf

An optimal bound for path weights in Huffman trees

✍ Peter Kirrinnis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Optimal path in random networks with dis

Optimal path in random networks with disorder: A mini review

✍ Shlomo Havlin; Lidia A. Braunstein; Sergey V. Buldyrev; Reuven Cohen; Tomer Kali 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Control charts: a cost-optimization appr

Control charts: a cost-optimization approach for processes with random shifts

✍ András Zempléni; Miklós Véber; Belmiro Duarte; Pedro Saraiva 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 2 views

## Abstract In this paper we describe an approach for establishing control limits and sampling times which derives from economic performance criteria and a model for random shifts. The total cost related to both production and control is calculated, based on cost estimates for false alarms, for not

Length of optimal path in random network

Length of optimal path in random networks with strong disorder

✍ Sergey V. Buldyrev; Lidia A. Braunstein; Reuven Cohen; Shlomo Havlin; H.Eugene S 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 237 KB