Sciweavers

228 search results - page 13 / 46
» Online Routing in Triangulations
Sort
View
UIST
2006
ACM
14 years 2 months ago
Personalizing routes
Navigation services (e.g., in-car navigation systems and online mapping sites) compute routes between two locations to help users navigate. However, these routes may direct users ...
Kayur Patel, Mike Y. Chen, Ian E. Smith, James A. ...
TON
2008
99views more  TON 2008»
13 years 8 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
VLSID
2005
IEEE
128views VLSI» more  VLSID 2005»
14 years 9 months ago
On-Line Synthesis for Partially Reconfigurable FPGAs
An important application of dynamically and partially reconfigurable computing platforms is in dynamic task allocation and execution. On-line synthesis, on-line placement and on-l...
Renqiu Huang, Ranga Vemuri
INFOCOM
2000
IEEE
14 years 1 months ago
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
Murali S. Kodialam, T. V. Lakshman
IJRR
2007
67views more  IJRR 2007»
13 years 8 months ago
Transfer Time Complexity of Conflict-free Vehicle Routing with no Communications
jr.sagepub.com/cgi/content/abstract/26/3/255 The online version of this article can be found at: Published by: http://www.sagepublications.com On behalf of: Multimedia Archives can...
Vikrant Sharma, Michael A. Savchenko, Emilio Frazz...