1941 search results - page 196 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
223
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
195
click to vote
SPAA
2003
ACM
16 years 11 days ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
182
click to vote
JCO
2010
15 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
210
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
209
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...