1300 search results - page 66 / 260 » Constraint satisfaction problems and global cardinality cons... |
148
click to vote
KCAP
2005
ACM
15 years 11 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
140
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
152
click to vote
ACG
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...
160
click to vote
CONSTRAINTS
2011
15 years 1 months ago
2011
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
159
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...