763 search results - page 63 / 153 » Engineering Shortest Path Algorithms |
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
ISCC
2005
IEEE
14 years 2 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
ISPAN
2005
IEEE
14 years 2 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
KDD
2004
ACM
14 years 2 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
JPDC
2006
13 years 9 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...