630 search results - page 68 / 126 » Hardness results for approximating the bandwidth |
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
124
Voted
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
120
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
103
Voted
IPSN
2010
Springer
15 years 7 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
115
click to vote
EMSOFT
2010
Springer
14 years 10 months ago
2010
Springer
Variable-bandwidth servers (VBS) control process execution speed by allocating variable CPU bandwidth to processes. VBS enables temporal isolation of EDF-scheduled processes in th...