✦ LIBER ✦

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

✍ Scribed by Michael Kuby; Xu Zhongyi; Xie Xiaodong

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for finding the K b

✍ Castanon, D.A. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 490 KB

K⁎: A heuristic search algorithm for fin

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

Finding the best set of K paths through

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

An algorithm for finding the k quickest

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

A genetic algorithm for finding the k sh

✍ Ahmed Younes Hamed 📂 Article 📅 2010 🏛 Elsevier 🌐 English ⚖ 801 KB

Finding best-fitted rectangle for region

✍ D. Chaudhuri, N. K. Kushwaha, I. Sharif, A. Samal 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 478 KB