749 search results - page 133 / 150 » Dualities for Constraint Satisfaction Problems |
TALG
2010
13 years 8 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
BMCBI
2007
13 years 10 months ago
2007
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
CP
2007
Springer
14 years 4 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...
CP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...