137 search results - page 1 / 28 » Applying Decomposition Methods to Crossword Puzzle Problems |
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we investigate the performance of several existing structural decomposition methods on fully interlocked Crossword Puzzle Problems (CPPs) and draw directio...
GD
2003
Springer
13 years 10 months ago
2003
Springer
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
AAAI
1998
13 years 6 months ago
1998
Manyproblems,such as the sliding-tile puzzles, generate searchtrees wheredifferent nodeshavedifferent numbersof children, in this case dependingon the position of the blank. Wesho...
MOC
2002
13 years 4 months ago
2002
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...
EOR
2006
13 years 4 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...