4524 search results - page 63 / 905 » The Complexity of Global Constraints |
105
Voted
AAAI
2008
15 years 2 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
149
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
— This paper analyzes the behavior of interconnects in the highly structured environment of a network-on-chip (NoC). Two distinct classes of wires are considered, namely links be...
94
Voted
JGO
2008
15 years 15 days ago
2008
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
84
Voted
MP
2006
15 years 14 days ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...