2398 search results - page 64 / 480 » Constraint Programming and Graph Algorithms |
131
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
115
click to vote
ICLP
1994
Springer
15 years 8 months ago
1994
Springer
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
124
click to vote
SAC
2010
ACM
15 years 9 months ago
2010
ACM
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
146
click to vote
CC
2009
Springer
15 years 9 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
127
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...