2084 search results - page 201 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
124
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
108
click to vote
ROBOCOMM
2007
IEEE
15 years 8 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
182
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...
126
click to vote
JMLR
2006
15 years 2 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...