Applying Decomposition Methods to Crossword Puzzle Problems

13 years 10 months ago

Download consystlab.unl.edu

Abstract. In this paper, we investigate the performance of several existing structural decomposition methods on fully interlocked Crossword Puzzle Problems (CPPs) and draw directions for future research.

Yaling Zheng, Berthe Y. Choueiry

Real-time Traffic

CP 2005 | Crossword Puzzle Problems | Future Research | Programming Languages | Structural Decomposition Methods |

claim paper

Related Content

» The Puzzle Layout Problem

» The Branching Factor of Regular Search Spaces

» Global and uniform convergence of subspace correction methods for some convex optimization...

» Applying machine based decomposition in 2machine flow shops

» Domain Decomposition Methods for PDE Constrained Optimization Problems

» Affine Puzzle Realigning Deformed Object Fragments without Correspondences

» Nonstationary noise estimation method based on biasresidual component decomposition for ro...

» Timeconstrained project scheduling with adjacent resources

» Additive Regression Applied to a LargeScale Collaborative Filtering Problem

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	CP
Authors	Yaling Zheng, Berthe Y. Choueiry

Comments (0)

Sciweavers

Applying Decomposition Methods to Crossword Puzzle Problems

CP 2005 | Crossword Puzzle Problems | Future Research | Programming Languages | Structural Decomposition Methods |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers