✦ LIBER ✦

Efficient algorithms for finding the K best paths through a trellis

✍ Scribed by Castanon, D.A.

Book ID: 111952125
Publisher: IEEE
Year: 1990
Tongue: English
Weight: 490 KB
Volume: 26
Category: Article
ISSN: 0018-9251
DOI: 10.1109/7.53448

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the best set of K paths through

Finding the best set of K paths through a trellis with application to multitarget tracking

✍ Wolf, J.K.; Viterbi, A.M.; Dixon, G.S. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 749 KB

A Minimax Method for Finding the k Best

A Minimax Method for Finding the k Best “Differentiated” Paths

✍ Michael Kuby; Xu Zhongyi; Xie Xiaodong 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 989 KB

K⁎: A heuristic search algorithm for fin

K⁎: A heuristic search algorithm for finding the k shortest paths

✍ Husain Aljazzar; Stefan Leue 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 724 KB

Efficient Algorithms for Finding the Max

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note

A space efficient algorithm for finding

A space efficient algorithm for finding the best nonoverlapping alignment score

✍ Gary Benson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 819 KB

An algorithm for finding the k quickest

An algorithm for finding the k quickest paths in a network

✍ Y.L. Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 652 KB