866 search results - page 75 / 174 » Networked Slepian-Wolf: Theory and Algorithms |
201
click to vote
JSAC
2011
14 years 9 months ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
175
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
159
click to vote
SAGT
2009
Springer
16 years 26 days ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
157
click to vote
RIVF
2007
15 years 7 months ago
2007
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
194
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization an...