276 search results - page 15 / 56 » Global Optimization of Probabilistically Constrained Linear ... |
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
13 years 3 months ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
VLSID
2003
IEEE
14 years 8 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
VLSM
2005
Springer
14 years 1 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
AAAI
1994
13 years 9 months ago
1994
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...