1578 search results - page 65 / 316 » Direct Routing: Algorithms and Complexity |
138
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
102
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In off-line streaming, packet level erasure resilient Forward Error Correction (FEC) codes rely on the unrestricted buffering time at the receiver. In real-time streaming, the ext...
127
Voted
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A...
98
Voted
SIROCCO
2003
15 years 4 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
128
Voted
ICC
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper proposes an approach to Traffic Engineering that uses Differentiated Services (diffserv) and Multi-Protocol Label Switching (MPLS) to provide quantitative QoS guarantees...