174 search results - page 7 / 35 » Interval-valued soft constraint problems |
104
click to vote
CONSTRAINTS
2008
14 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
ACMICEC
2006
ACM
15 years 3 months ago
2006
ACM
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...
HEURISTICS
2006
14 years 9 months ago
2006
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
CIRA
2007
IEEE
15 years 3 months ago
2007
IEEE
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
BPM
2006
Springer
15 years 1 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...