13841 search results - page 269 / 2769 » Algorithms and Constraint Programming |
172
click to vote
CSCLP
2004
Springer
15 years 10 months ago
2004
Springer
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
157
click to vote
IJON
2008
15 years 6 months ago
2008
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
172
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
173
click to vote
SARA
2007
Springer
16 years 23 days ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
163
click to vote
4OR
2004
15 years 6 months ago
2004
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...