1647 search results - page 49 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
112
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
110
click to vote
AAAI
2010
15 years 2 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
115
click to vote
JUCS
2007
15 years 2 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
121
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
137
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...