591 search results - page 1 / 119 » A constraint programming approach to cutset problems |
COR
2006
13 years 11 months ago
2006
ICTAI
2009
IEEE
13 years 8 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
ASPDAC
1999
ACM
14 years 3 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
RSP
1998
IEEE
14 years 3 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
CPAIOR
2010
Springer
14 years 3 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...