2084 search results - page 251 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper we develop a distributed rate control algorithm for multiple-unicast-sessions when network coding is allowed. Building on our recent flow-based characterization o...
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having glob...
PODC
2010
ACM
14 years 8 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
IPSN
2010
Springer
15 years 4 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...