2084 search results - page 46 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
UAI
2001
14 years 11 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
IJRR
2002
14 years 9 months ago
2002
This paper presents the time optimal trajectories for differential drive vehicles in the unobstructed plane. The wheel angular velocities are bounded, but may be discontinuous. Th...
102
click to vote
JSA
2007
14 years 9 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...