524 search results - page 71 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
TCS
2008
13 years 7 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
INFOCOM
1997
IEEE
13 years 12 months ago
1997
IEEE
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
INFOCOM
2002
IEEE
14 years 20 days ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...