190 search results - page 9 / 38 » Improved Algorithm for the Soft Global Cardinality Constrain... |
76
Voted
CPAIOR
2009
Springer
15 years 4 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 ...
78
Voted
COMPULOG
1999
Springer
15 years 1 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
91
Voted
CONSTRAINTS
2011
14 years 4 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...
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....
FLAIRS
2008
14 years 12 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...