630 search results - page 48 / 126 » Hardness results for approximating the bandwidth |
181
click to vote
GLOBECOM
2008
IEEE
16 years 18 days ago
2008
IEEE
— In this paper, we study QoS routing in wireless mesh networks with cognitive radios, which involves route selection, channel allocation and scheduling. It turns out to be a har...
182
click to vote
MIDDLEWARE
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Loadbalancing is inherent in these protocols a...
187
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal secondorder rate control algorithm, called the -contr...
165
click to vote
IPPS
2009
IEEE
16 years 24 days ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
214
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...