13987 search results - page 503 / 2798 » The Two Guards Problem |
185
click to vote
CVIU
2004
15 years 6 months ago
2004
In this paper we address the problem of matching two images with two different resolutions: a high-resolution image and a low-resolution one. The difference in resolution between ...
202
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
187
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
204
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a...
227
Voted
CORR
2011
Springer
15 years 2 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...