Sciweavers

108 search results - page 21 / 22
» Deterministic recurrent communication in restricted Sensor N...
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
13 years 10 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
ICDCN
2009
Springer
14 years 4 days ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
OPODIS
2004
13 years 6 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 5 months ago
Sidelobe Control in Collaborative Beamforming via Node Selection
Collaborative beamforming (CB) is a power efficient method for data communications in wireless sensor networks (WSNs) which aims at increasing the transmission range in the network...
Mohammed F. A. Ahmed, Sergiy A. Vorobyov
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 5 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes