15033 search results - page 313 / 3007 » Complexity Theory and Algorithms |
174
click to vote
WSNA
2003
ACM
15 years 10 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
115
click to vote
COLT
2003
Springer
15 years 10 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
164
click to vote
DNA
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Self-assembly is a process in which basic units aggregate under attractive forces to form larger compound structures. Recent theoretical work has shown that pseudo-crysta...
141
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
147
click to vote
JSAC
2006
15 years 5 months ago
2006
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...