1272 search results - page 145 / 255 » The Set Cover with Pairs Problem |
ICC
2007
IEEE
14 years 5 months ago
2007
IEEE
— In this paper, we study the angle coverage problem in visual sensor networks where all sensors are equipped with cameras. An object of interest moves around the network and the...
ENC
2004
IEEE
14 years 2 months ago
2004
IEEE
This paper deals with the problem of controlling highly dynamic mechatronic systems. Such systems may work in several different operation modes, or even underlie continuous mode c...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
FOSSACS
2007
Springer
14 years 2 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
ALENEX
2001
14 years 2 days ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...