971 search results - page 39 / 195 » Approximate Satisfiability and Equivalence |
DEXA
2008
Springer
13 years 11 months ago
2008
Springer
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
SIAMJO
2002
13 years 9 months ago
2002
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...