66 search results - page 8 / 14 » Optimal oblivious routing in polynomial time |
ATMOS
2009
13 years 8 months ago
2009
Trains often arrive delayed at stations where passengers have to change to other trains. The question of delay management is whether these trains should wait for the original train...
INFOCOM
2003
IEEE
14 years 20 days ago
2003
IEEE
—The terrorist attacks on September 11, 2001 have drawn attention to the use of wireless technology in order to locate survivors of structural collapse. We propose to construct a...
ICAI
2010
13 years 5 months ago
2010
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
MOBICOM
2003
ACM
14 years 19 days ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...