1298 search results - page 150 / 260 » The online set cover problem |
157
click to vote
IVC
2000
15 years 6 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
206
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
131
click to vote
ICC
2007
IEEE
16 years 24 days 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...
159
click to vote
ENC
2004
IEEE
15 years 10 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...
172
click to vote
ESA
2006
Springer
15 years 10 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...