6 search results - page 1 / 2 » The approach-dependent, time-dependent, label-constrained sh... |
134
click to vote
AAIM
2008
Springer
15 years 5 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
148
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
145
click to vote
WEA
2010
Springer
15 years 9 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...
139
click to vote
GIS
2010
ACM
15 years 2 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
147
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...