374 search results - page 33 / 75 » On Communicating Automata with Bounded Channels |
178
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
ACT We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean de...
175
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we consider a cooperative network that is trying to reach binary consensus over fading channels. We first characterize the impact of fading on network consensus by up...
159
click to vote
SASO
2008
IEEE
16 years 15 days ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
143
click to vote
TCOM
2008
15 years 6 months ago
2008
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...