Sciweavers

184 search results - page 25 / 37
» Novel Broadcasting Algorithm of the Complete Recursive Netwo...
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Task-pushing: a Scalable Parallel GC Marking Algorithm without Synchronization Operations
This paper describes a scalable parallel marking technique for garbage collection that does not employ any synchronization operation. To achieve good scalability, two major design...
Ming Wu, Xiao-Feng Li
ICASSP
2008
IEEE
14 years 1 months ago
Stability analysis of the consensus-based distributed LMS algorithm
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...
Ioannis D. Schizas, Gonzalo Mateos, Georgios B. Gi...
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 6 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
GLOBECOM
2008
IEEE
14 years 1 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
12 years 9 months ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang