12519 search results - page 191 / 2504 » Approximation Problems Categories |
199
click to vote
PCM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...
154
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
166
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
177
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
179
click to vote
IEICET
2010
15 years 3 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...