2084 search results - page 183 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
141
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
211
click to vote
QEST
2010
IEEE
15 years 3 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
180
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
179
click to vote
ISPD
2004
ACM
15 years 11 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
137
click to vote
IPPS
2007
IEEE
16 years 9 days ago
2007
IEEE
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...