2957 search results - page 111 / 592 » The Complexity of Polynomial-Time Approximation |
157
click to vote
PCM
2004
Springer
15 years 8 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...
145
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
118
click to vote
DISOPT
2010
15 years 3 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
120
click to vote
CASC
2009
Springer
15 years 9 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
128
click to vote
CP
2008
Springer
15 years 5 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...