BPM
2006
Springer
13 years 8 months ago
2006
Springer
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are uniquely associated to element...
CSCLP
2003
Springer
13 years 9 months ago
2003
Springer
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Stefano Bi...
CAEPIA
2003
Springer
13 years 9 months ago
2003
Springer
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constr...
SSPR
2004
Springer
13 years 10 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...
MOZ
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
MICAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
KR
2004
Springer
13 years 10 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
DSOM
2004
Springer
13 years 10 months ago
2004
Springer
In utility computing environments, multiple users and applications are served from the same r esource pool. To maintain service level objectives and maintain high levels of utiliza...
GD
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...