674 search results - page 95 / 135 » The computational complexity of the parallel knock-out probl... |
104
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
107
click to vote
EGC
2005
Springer
15 years 6 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
118
click to vote
EGC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Monitoring systems are nowadays ubiquitous in complex environments, such as Grids. Their use is fundamental for performance evaluation, problem spotting, advanced debuggi...
125
click to vote
DCOSS
2007
Springer
15 years 5 months ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
154
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...