144 search results - page 17 / 29 » Quality of LP-Based Approximations for Highly Combinatorial ... |
MOC
2011
14 years 4 months ago
2011
Abstract. Local energy error estimates for the finite element method for elliptic problems were originally proved in 1974 by Nitsche and Schatz. These estimates show that the loca...
AAAI
2004
14 years 10 months ago
2004
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
AAAI
2006
14 years 10 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
TCS
2010
14 years 7 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...