✦ LIBER ✦

Maximum-shortest-path (MSP) is not optimal for a general N × N torus

✍ Scribed by Li Sheng; Jie Wu

Book ID: 114668187
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 297 KB
Volume: 52
Category: Article
ISSN: 0018-9529
DOI: 10.1109/tr.2002.807240

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A General Algorithm for Finding a Shorte

A General Algorithm for Finding a Shortest Path between two n-Configurations

✍ M.C. Er 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 254 KB

New polynomial time algorithms to comput

New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

✍ Sastry, V. N.; Janakiraman, T. N.; Mohideen, S. Ismail 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 226 KB

The Optimal Search for a Moving Target W

The Optimal Search for a Moving Target When the Search Path is Constrained

✍ James N. Eagle 📂 Article 📅 1984 🏛 INFORMS 🌐 English ⚖ 250 KB

Antiserum against the conserved nine ami

Antiserum against the conserved nine amino acid N-terminal peptide of influenza A virus matrix protein 2 is not immunoprotective

✍ De Filette, M.; Ysenbaert, T.; Roose, K.; Schotsaert, M.; Roels, S.; Goossens, E 📂 Article 📅 2010 🏛 Society for General Microbiology 🌐 English ⚖ 399 KB

Increased blood brain barrier permeabili

Increased blood brain barrier permeability is not a primary determinant for lethality of West Nile virus infection in rodents

✍ Morrey, J. D.; Olsen, A. L.; Siddharthan, V.; Motter, N. E.; Wang, H.; Taro, B. 📂 Article 📅 2008 🏛 Society for General Microbiology 🌐 English ⚖ 282 KB