530 search results - page 2 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
IPL
2008
13 years 7 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
CDC
2010
IEEE
13 years 2 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 ...
IPL
2008
13 years 7 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...