Sciweavers

6554 search results - page 413 / 1311
» Constraint Logic Programming
Sort
View
ECML
2005
Springer
16 years 8 days ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
CSCLP
2004
Springer
15 years 10 months ago
Constraint-Based Approaches to the Covering Test Problem
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...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
IJON
2008
92views more  IJON 2008»
15 years 6 months ago
Nonnegative matrix factorization with quadratic programming
Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A RI
Rafal Zdunek, Andrzej Cichocki
CPAIOR
2009
Springer
16 years 1 months ago
The Polytope of Context-Free Grammar Constraints
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 ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
SARA
2007
Springer
16 years 26 days ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...