Sciweavers

552 search results - page 100 / 111
» Lower bounds for dynamic connectivity
Sort
View
SOSP
2001
ACM
14 years 4 months ago
The Costs and Limits of Availability for Replicated Services
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A ke...
Haifeng Yu, Amin Vahdat
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 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
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
13 years 2 months ago
Consensus-based distributed linear filtering
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
Ion Matei, John S. Baras
JMLR
2010
157views more  JMLR 2010»
13 years 2 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
IPPS
2007
IEEE
14 years 2 months ago
Topology-Transparent Duty Cycling for Wireless Sensor Networks
Our goal is to save energy in wireless sensor networks (WSNs) by periodic duty-cycling of sensor nodes. We schedule sensor nodes between active (transmit or receive) and sleep mod...
Yu Chen, Eric Fleury, Violet R. Syrotiuk