374 search results - page 48 / 75 » On Communicating Automata with Bounded Channels |
172
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
161
click to vote
VTC
2007
IEEE
16 years 13 days ago
2007
IEEE
Abstract— In this paper we consider serially concatenated and iteratively decoded Irregular Variable Length Coding (IrVLC) combined with precoded Differential Space-Time Spreadin...
228
click to vote
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
202
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...
164
click to vote
SIGMETRICS
2010
ACM
15 years 11 months ago
2010
ACM
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...