554 search results - page 82 / 111 » Approximability of OFDMA Scheduling |
141
click to vote
GLOBECOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—With recent advances in optical technology, we are closer to building all-optical routers than ever before. A major problem in this area, however, is the lack of all-optical mem...
130
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
148
click to vote
IM
2007
15 years 5 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...
126
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
127
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—In this paper, we present MobTorrent, an ondemand, user-driven framework designed for vehicles which have intermittent high speed access to roadside WiFi access points (...