350 search results - page 37 / 70 » Lower and upper bounds on obtaining history independence |
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
119
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
Abstract-- We propose an algorithm for decentralised navigation of multiple independent agents, applicable to Robotics and Air Traffic Control (ATC). We present completely decentra...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
INFOCOM
2003
IEEE
15 years 5 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...
103
click to vote
FPGA
1999
ACM
15 years 4 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...