1240 search results - page 62 / 248 » Composition with Target Constraints |
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...
103
click to vote
ASWEC
2006
IEEE
15 years 3 months ago
2006
IEEE
Web services are designed for composition and use by third parties through dynamic discovery. As such, the issue of interoperability between services is of great importance to ens...
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
CAV
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
CP
2005
Springer
15 years 3 months ago
2005
Springer
There is no unified modeling standard available to the CP community, so constraint programs can not be developed independently from the used CP library. Without such standard, CP ...