592 search results - page 60 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
108
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
126
click to vote
CDC
2010
IEEE
2010
IEEE
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
14 years 10 months ago
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
120
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
131
click to vote
JMLR
2006
15 years 3 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
118
click to vote
ATMOS
2007
15 years 4 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...