1300 search results - page 138 / 260 » Constraint satisfaction problems and global cardinality cons... |
IGPL
2006
14 years 10 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
AAAI
2004
14 years 11 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
JGO
2008
14 years 10 months ago
2008
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
AUSAI
2009
Springer
15 years 1 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...