Sciweavers

530 search results - page 90 / 106
» Bounds on marginal probability distributions
Sort
View
ICDCS
2005
IEEE
14 years 1 months ago
Controlling Gossip Protocol Infection Pattern Using Adaptive Fanout
We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of go...
Satish Verma, Wei Tsang Ooi
IPSN
2004
Springer
14 years 1 months ago
Adaptive clock synchronization in sensor networks
Recent advances in technology have made low cost, low power wireless sensors a reality. Clock synchronization is an important service in any distributed system, including sensor n...
Santashil PalChaudhuri, Amit Kumar Saha, David B. ...
COMBINATORICA
2011
12 years 8 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
ICML
2009
IEEE
14 years 9 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
14 years 8 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat