K shortest path routing

Results: 9



#Item
1Disambiguating Road Names in Text Route Descriptions using Exact-All-Hop Shortest Path Algorithm Xiao Zhang⋆ △ and Baojun Qiu⋆⋄ and Prasenjit Mitra⋆† and Sen Xu‡ and Alexander Klippel‡ and Alan M. MacEach

Disambiguating Road Names in Text Route Descriptions using Exact-All-Hop Shortest Path Algorithm Xiao Zhang⋆ △ and Baojun Qiu⋆⋄ and Prasenjit Mitra⋆† and Sen Xu‡ and Alexander Klippel‡ and Alan M. MacEach

Add to Reading List

Source URL: cognitivegiscience.psu.edu

Language: English - Date: 2012-07-13 14:23:32
2Fast A3 Algorithms for Multiple Sequence Alignment Takahiro Ikeda Hiroshi Imai

Fast A3 Algorithms for Multiple Sequence Alignment Takahiro Ikeda Hiroshi Imai

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 1998-01-09 02:49:52
3Directed Graph Exploration Klaus-Tycho Foerster and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {k-t.foerster,wattenhofer}@tik.ee.ethz.ch

Directed Graph Exploration Klaus-Tycho Foerster and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {k-t.foerster,wattenhofer}@tik.ee.ethz.ch

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:04
4

PDF Document

Add to Reading List

Source URL: www.cs.ucsb.edu

Language: English - Date: 2012-06-06 03:08:31
5GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks ∗ Arjun Singh , William J Dally , Amit K Gupta , Brian Towles Computer Systems Laboratory Stanford University {arjuns, billd, agupta, btowles}@cva.sta

GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks ∗ Arjun Singh , William J Dally , Amit K Gupta , Brian Towles Computer Systems Laboratory Stanford University {arjuns, billd, agupta, btowles}@cva.sta

Add to Reading List

Source URL: cva.stanford.edu

Language: English - Date: 2005-12-01 13:38:04
6NDN, Technical Report NDN-0003, 2012. http://named-data.net/techreports.html  OSPFN: An OSPF Based Routing Protocol for Named Data Networking Lan Wang∗, A K M Mahmudul Hoque∗, Cheng Yi†, Adam Alyyan∗, Beichuan Zh

NDN, Technical Report NDN-0003, 2012. http://named-data.net/techreports.html OSPFN: An OSPF Based Routing Protocol for Named Data Networking Lan Wang∗, A K M Mahmudul Hoque∗, Cheng Yi†, Adam Alyyan∗, Beichuan Zh

Add to Reading List

Source URL: www.named-data.net

Language: English - Date: 2013-08-09 21:32:20
7Finding the k Shortest Paths David Eppstein∗ March 31, 1997 Abstract We give algorithms for finding the k shortest paths (not required to be simple) connecting a

Finding the k Shortest Paths David Eppstein∗ March 31, 1997 Abstract We give algorithms for finding the k shortest paths (not required to be simple) connecting a

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 1998-09-22 19:03:25
8Finding the k Shortest Paths David Eppstein∗ Department of Information and Computer Science University of California, Irvine, CA[removed]Tech. Report[removed]May 31, 1994

Finding the k Shortest Paths David Eppstein∗ Department of Information and Computer Science University of California, Irvine, CA[removed]Tech. Report[removed]May 31, 1994

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 1999-10-05 17:48:13
9Techniques for automated Network Map Generation using SNMP Glenn Manseld, M. Ouchi, K. Jayanthi, Y. Kimura Kohei Ohta, Yoshiaki Nemoto  Advanced Intelligent Communication

Techniques for automated Network Map Generation using SNMP Glenn Mans eld, M. Ouchi, K. Jayanthi, Y. Kimura Kohei Ohta, Yoshiaki Nemoto Advanced Intelligent Communication

Add to Reading List

Source URL: www.cysol.co.jp

Language: English - Date: 2013-11-19 01:19:25