Sciweavers

111 search results - page 16 / 23
» On the local performance of simulated annealing and the (1 1...
Sort
View
SENSYS
2006
ACM
14 years 1 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
PAAPP
2007
104views more  PAAPP 2007»
13 years 7 months ago
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Abstract— This paper studies the WSN application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling a...
Wen-Zhan Song, Fenghua Yuan, Richard LaHusen, Behr...
ICS
2010
Tsinghua U.
13 years 12 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
ICASSP
2011
IEEE
12 years 11 months ago
Can one hear the shape of a room: The 2-D polygonal case
We consider the problem of estimating room geometry from the acoustic room impulse response (RIR). Existing approaches addressing this problem exploit the knowledge of multiple RI...
Ivan Dokmanic, Yue M. Lu, Martin Vetterli
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li