808 search results - page 45 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
LATIN
2010
Springer
14 years 8 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
CP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...