1142 search results - page 54 / 229 » Approximability of Clausal Constraints |
154
click to vote
WCE
2007
15 years 7 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
148
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
163
click to vote
AAAI
1992
15 years 7 months ago
1992
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
169
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
148
click to vote
ICIP
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...