Sciweavers

2421 search results - page 433 / 485
» Approximate Flow-Aware Networking
Sort
View
EDBT
2008
ACM
125views Database» more  EDBT 2008»
16 years 2 months ago
On the brink: searching for drops in sensor data
Sensor networks have been widely used to collect data about the environment. When analyzing data from these systems, people tend to ask exploratory questions--they want to find su...
Gong Chen, Junghoo Cho, Mark H. Hansen
111
Voted
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
15 years 11 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
ICCAD
2006
IEEE
129views Hardware» more  ICCAD 2006»
15 years 11 months ago
Energy budgeting for battery-powered sensors with a known task schedule
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
Daler N. Rakhmatov
132
Voted
SOSP
2001
ACM
15 years 11 months ago
Storage Management and Caching in PAST, A Large-scale, Persistent Peer-to-peer Storage Utility
This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetba...
Antony I. T. Rowstron, Peter Druschel
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
15 years 11 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich