2084 search results - page 114 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
130
click to vote
PE
2010
Springer
15 years 1 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
112
Voted
STACS
2009
Springer
15 years 9 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
147
Voted
SAC
2010
ACM
15 years 9 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
118
Voted
LOGCOM
2002
15 years 2 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
138
Voted
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...