Sciweavers

2084 search results - page 321 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
DCOSS
2009
Springer
15 years 4 months ago
Fast Self-stabilization for Gradients
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...
ICML
2005
IEEE
15 years 10 months ago
Bayesian hierarchical clustering
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...
Katherine A. Heller, Zoubin Ghahramani
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
15 years 3 months ago
Improved offset-analysis using multiple timing-references
In this paper, we present an extension to existing approaches that capture and exploit timing-correlation between tasks for scheduling analysis in distributed systems. Previous ap...
Rafik Henia, Rolf Ernst
AAAI
2010
14 years 11 months ago
Sequential Incremental-Value Auctions
We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all ta...
Xiaoming Zheng, Sven Koenig
PODC
2005
ACM
15 years 3 months ago
Toward a theory of transactional contention managers
In recent software transactional memory proposals, a contention manager module is responsible for ensuring that the system as a whole makes progress. A number of contention manage...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon