1378 search results - page 23 / 276 » The Tractability of Global Constraints |
131
click to vote
CPAIOR
2007
Springer
15 years 8 months ago
2007
Springer
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
107
click to vote
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
115
click to vote
CP
2008
Springer
15 years 3 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
150
click to vote
CONSTRAINTS
2011
14 years 9 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
105
click to vote
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...