Sciweavers

52 search results - page 9 / 11
» Average-case Complexity
Sort
View
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 4 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
INFOCOM
2008
IEEE
14 years 4 months ago
Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
Hanna Kalosha, Amiya Nayak, Stefan Rührup, Iv...
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 4 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
FGCS
2008
103views more  FGCS 2008»
13 years 9 months ago
A case for cooperative and incentive-based federation of distributed clusters
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to ma...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya
RIDE
1998
IEEE
14 years 2 months ago
On Periodic Resource Scheduling for Continuous Media Databases
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popula...
Minos N. Garofalakis, Banu Özden, Abraham Sil...