Sciweavers

242 search results - page 32 / 49
» Distributed algorithms with dynamical random transitions
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 12 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 1 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
SPIN
2004
Springer
15 years 5 months ago
Explicit State Model Checking with Hopper
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
Michael Jones, Eric Mercer
CDC
2008
IEEE
163views Control Systems» more  CDC 2008»
15 years 6 months ago
A cooperative deployment strategy for optimal sampling in spatiotemporal estimation
— 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...
Rishi Graham, Jorge Cortés
IPPS
2006
IEEE
15 years 5 months ago
Hash-based proximity clustering for load balancing in heterogeneous DHT networks
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...
Haiying Shen, Cheng-Zhong Xu