4117 search results - page 186 / 824 » On the Satisfiability of Complex Constraints |
144
click to vote
CPAIOR
2004
Springer
15 years 12 months ago
2004
Springer
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
179
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
184
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
166
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
132
click to vote
AAAI
2006
15 years 8 months ago
2006
We report on random stimuli generation for hardware verification in IBM as a major application of various artificial intelligence technologies, including knowledge representation,...