356 search results - page 21 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
KR
1998
Springer
14 years 27 days ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
IJCAI
1989
13 years 9 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
ATMOS
2007
13 years 10 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
CP
2006
Springer
14 years 12 days ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
ECIR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...