711 search results - page 126 / 143 » Amalgams of Constraint Satisfaction Problems |
TALG
2010
14 years 10 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], ...
CP
2007
Springer
15 years 6 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
15 years 5 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...
106
click to vote
CP
2003
Springer
15 years 5 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...
80
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...