390 search results - page 5 / 78 » Computing shortest paths for any number of hops |
124
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
113
click to vote
FTDCS
2004
IEEE
15 years 3 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
120
click to vote
ISCC
2009
IEEE
15 years 6 months ago
2009
IEEE
Routing protocols for Wireless Sensor Networks (WSN) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of p...
100
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
INFOCOM
1993
IEEE
15 years 3 months ago
1993
IEEE
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...