Sciweavers

477 search results - page 92 / 96
» Complexity Considerations, cSAT Problem Lower Bound
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
On Optimal MAC Scheduling With Physical Interference
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
EMSOFT
2004
Springer
14 years 27 days ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
TPDS
2010
87views more  TPDS 2010»
13 years 5 months ago
An ISP-Friendly File Distribution Protocol: Analysis, Design, and Implementation
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
Minghong Lin, John C. S. Lui, Dah-Ming Chiu
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 9 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 11 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson