Sciweavers

2084 search results - page 294 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
15 years 7 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
DC
2007
14 years 9 months ago
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
Josef Widder, Ulrich Schmid
FOCS
2009
IEEE
15 years 4 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer
ATAL
2009
Springer
15 years 4 months ago
Self-organising agent organisations
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
IWCMC
2006
ACM
15 years 3 months ago
On the robustness of grid-based deployment in wireless sensor networks
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...
Kenan Xu, Glen Takahara, Hossam S. Hassanein