Sciweavers

4524 search results - page 12 / 905
» The Complexity of Global Constraints
Sort
View
CACM
2010
94views more  CACM 2010»
15 years 14 days ago
Constraint satisfaction problems and global cardinality constraints
Andrei A. Bulatov, Dániel Marx
92
Voted
DAC
2009
ACM
16 years 1 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
101
Voted
CSCLP
2005
Springer
15 years 5 months ago
Among, Common and Disjoint Constraints
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
Christian Bessière, Emmanuel Hebrard, Brahi...
75
Voted
IJCAI
2001
15 years 1 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti