✦ LIBER ✦

An improved algorithm for the shortest descending path on a convex terrain

✍ Scribed by Wei, Xiangzhi; Joneja, Ajay

Book ID: 120307968
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 209 KB
Volume: 19
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.12.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Near optimal algorithm for the shortest

Near optimal algorithm for the shortest descending path on the surface of a convex terrain

✍ Roy, Sasanka 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 216 KB

An improved solution algorithm for the c

An improved solution algorithm for the constrained shortest path problem

✍ Luis Santos; João Coutinho-Rodrigues; John R. Current 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Analysis for shortest path algorithm on

Analysis for shortest path algorithm on convex polytope in E3

✍ Lee, Young Soo; Lee, Eun-seok 📂 Article 📅 2000 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 369 KB

An algorithm for determining the shortes

An algorithm for determining the shortest path on a network graph

✍ S.M. Alekseeva; O.G. Alekseev 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 568 KB

An Incremental Algorithm for a Generaliz

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

✍ G. Ramalingam; Thomas Reps 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv

A Note on Spira’s Algorithm for the All-

A Note on Spira’s Algorithm for the All-Pairs Shortest-Path Problem

✍ Carson, John S.; Law, Averill M. 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 327 KB