4894 search results - page 346 / 979 » The Guarding Problem - Complexity and Approximation |
179
click to vote
NETWORKS
2007
15 years 6 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
147
click to vote
ECCV
1996
Springer
16 years 8 months ago
1996
Springer
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
218
click to vote
RTAS
2006
IEEE
16 years 22 days ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
157
click to vote
COCOON
2005
Springer
16 years 8 days ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
184
click to vote
CP
2005
Springer
16 years 8 days ago
2005
Springer
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...