2974 search results - page 136 / 595 » Model-Driven Constraint Programming |
152
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
200
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
165
click to vote
CPAIOR
2009
Springer
16 years 28 days 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 ...
165
click to vote
SARA
2007
Springer
16 years 14 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...
160
click to vote
ESOP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...