3008 search results - page 533 / 602 » Independence in connected graphs |
156
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— 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...
210
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
180
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
169
click to vote
ADHOC
2005
15 years 6 months ago
2005
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
151
click to vote
SMA
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...