1142 search results - page 121 / 229 » Approximability of Clausal Constraints |
159
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
197
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
172
click to vote
ML
2008
ACM
15 years 6 months ago
2008
ACM
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
198
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
208
click to vote
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...