2084 search results - page 326 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper considers a network composed of robotic agents and static nodes performing spatial estimation of a dynamic physical processes. The physical process is modeled as a s...
STOC
1997
ACM
15 years 2 months ago
1997
ACM
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
ALENEX
2010
14 years 11 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where bo...