279 search results - page 51 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
CASES
2006
ACM
14 years 1 months ago
2006
ACM
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We investigate the effect of packet delays and packet drops on networked control systems. First we consider the problem of where to locate a controller or state estimator in a...
ENTCS
2007
13 years 7 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...