524 search results - page 64 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
INFOCOM
1998
IEEE
14 years 3 hour ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we consider the problem of secret communication through Rayleigh fading single-input multiple-output (SIMO) broadcast channel in the presence of an eavesdropper. At...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multihop wireless networks is discussed. The goal of maximizing a utili...