2343 search results - page 331 / 469 » The Locomotive Routing Problem |
148
Voted
SODA
1998
ACM
15 years 6 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
118
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We suggest a new, unconventional, way for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build a device which can ...
143
click to vote
TIT
2008
15 years 5 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
170
click to vote
TMC
2008
15 years 4 months ago
2008
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...
138
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...