592 search results - page 46 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
164
click to vote
EMNLP
2006
15 years 4 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
136
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
127
Voted
CPAIOR
2007
Springer
15 years 9 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
CP
2003
Springer
15 years 8 months ago
2003
Springer
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
120
click to vote
AUTOMATICA
2008
15 years 3 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...