190 search results - page 6 / 38 » Improved Algorithm for the Soft Global Cardinality Constrain... |
SSPR
2004
Springer
15 years 3 months ago
2004
Springer
Several clustering algorithms equipped with pairwise hard constraints between data points are known to improve the accuracy of clustering solutions. We develop a new clustering alg...
74
Voted
WCW
2004
Springer
15 years 3 months ago
2004
Springer
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
113
click to vote
WEA
2010
Springer
15 years 2 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
96
Voted
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
CP
2008
Springer
14 years 11 months ago
2008
Springer
Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR s...