552 search results - page 59 / 111 » Constrained Shortest Path Computation |
CN
2000
14 years 9 months ago
2000
Hop-by-hop inter-domain routing protocols, such as BGP and IDRP, use independent route selection to realize domains' local policies. A domain chooses its routes based on path...
WEA
2010
Springer
15 years 2 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
CCR
2002
14 years 9 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
102
click to vote
AINA
2007
IEEE
15 years 4 months ago
2007
IEEE
The purpose of this work is to present the Reference Path Ad hoc Routing (REPAR) mechanism, which has been designed to optimize the performance of reactive ad hoc routing protocol...
106
click to vote
VISUALIZATION
1997
IEEE
15 years 1 months ago
1997
IEEE
Navigation through 3D spaces is required in many interactive graphics and virtual reality applications. We consider the subclass of situations in which a 2D device such as a mouse...