137 search results - page 13 / 28 » Applying Decomposition Methods to Crossword Puzzle Problems |
AAAI
1994
13 years 10 months ago
1994
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
LSSC
2005
Springer
14 years 2 months ago
2005
Springer
We propose a new class of Discontinuous Galerkin (DG) methods based on variational multiscale ideas. Our approach begins with an additive decomposition of the discontinuous finite...
COCOS
2003
Springer
14 years 1 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
CP
2004
Springer
14 years 2 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
CONSTRAINTS
2011
13 years 5 days ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...