2957 search results - page 216 / 592 » The Complexity of Polynomial-Time Approximation |
277
click to vote
MST
2010
15 years 5 months ago
2010
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
286
click to vote
ICCABS
2011
14 years 10 months ago
2011
—Research efforts to analyze biomolecular properties contribute towards our understanding of biomolecular function. Calculating non-bonded forces (or in our case, electrostatic s...
187
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
149
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
146
click to vote
ISMVL
1994
IEEE
15 years 10 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...