137 search results - page 4 / 28 » Applying Decomposition Methods to Crossword Puzzle Problems |
FOIKS
2008
Springer
13 years 10 months ago
2008
Springer
We present a method for decomposing a hypergraph with certain regularities into smaller hypergraphs. By applying this to the set of all canonical covers of a given set of functiona...
CP
2008
Springer
13 years 10 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
ICAC
2007
IEEE
14 years 2 months ago
2007
IEEE
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
CONSTRAINTS
2011
13 years 3 months ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...