866 search results - page 88 / 174 » On Dynamic Shortest Paths Problems |
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
SENSYS
2006
ACM
14 years 4 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
AUTOMATICA
2010
13 years 10 months ago
2010
This article presents a solution to the path following problem for the planar vertical take-off and landing aircraft (PVTOL) which is applicable to a class of smooth Jordan curves...
PODC
1997
ACM
14 years 2 months ago
1997
ACM
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...