5 search results - page 1 / 1 » Solving (Weighted) Partial MaxSAT through Satisfiability Tes... |
SAT
2009
Springer
13 years 11 months ago
2009
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
JSAT
2008
13 years 4 months ago
2008
We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the ...
EOR
2007
13 years 4 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
ECML
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Many complex control problems are not amenable to traditional controller design. Not only is it difficult to model real systems, but often it is unclear what kind of beha...