Sciweavers

Share
BPM
2006
Springer
115views Business» more  BPM 2006»
9 years 1 months ago
Modeling, Matching and Ranking Services Based on Constraint Hardness
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...
Claudia d'Amato, Steffen Staab
CP
2000
Springer
9 years 1 months ago
Constraint Propagation for Soft Constraints: Generalization and Termination Conditions
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...
Stefano Bistarelli, Rosella Gennari, Francesca Ros...
CSCLP
2003
Springer
9 years 2 months ago
Learning Approximate Consistencies
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Stefano Bi...
Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh ...
CAEPIA
2003
Springer
9 years 2 months ago
Distributed Non-binary Constraints
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...
Miguel A. Salido, Federico Barber
SSPR
2004
Springer
9 years 2 months ago
Clustering with Soft and Group Constraints
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...
Martin H. C. Law, Alexander P. Topchy, Anil K. Jai...
MOZ
2004
Springer
9 years 2 months ago
Implementing Semiring-Based Constraints Using Mozart
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
Alberto Delgado, Carlos Alberto Olarte, Jorge Andr...
MICAI
2004
Springer
9 years 2 months ago
Evaluation-Based Semiring Meta-constraints
Abstract. Classical constraint satisfaction problems (CSPs) provide an expressive formalism for describing and solving many real-world problems. However, classical CSPs prove to be...
Jerome Kelleher, Barry O'Sullivan
KR
2004
Springer
9 years 2 months ago
An Improved Integer Local Search for Complex Scheduling Problems
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...
Weixiong Zhang, Xiaotao Zhang
DSOM
2004
Springer
9 years 2 months ago
Policy-Based Resource Assignment in Utility Computing Environments
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...
Cipriano A. Santos, Akhil Sahai, Xiaoyun Zhu, Dirk...
GD
2005
Springer
9 years 2 months ago
A Mixed-Integer Program for Drawing High-Quality Metro Maps
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...
Martin Nöllenburg, Alexander Wolff
books