410 search results - page 4 / 82 » Upgrading Shortest Paths in Networks |
116
Voted
DATESO
2009
14 years 9 months ago
2009
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
101
click to vote
BROADNETS
2007
IEEE
15 years 6 months ago
2007
IEEE
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
136
Voted
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
108
Voted
IWANN
1997
Springer
15 years 3 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
109
click to vote
ISAAC
2003
Springer
15 years 4 months ago
2003
Springer
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...