32 search results - page 6 / 7 » Finding the k Shortest Paths in Parallel |
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Quick and efficient response to emergency is important for every city. This depends on the quality of the dispatch of emergency service to the scene and back to hospital or other ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Dynamic networks, e.g. Mobile Ad Hoc Networks (MANETs), call for adaptive protocols that can tolerate topological changes due to nodes’ mobility and depletion of battery power. ...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...