59 search results - page 2 / 12 » On the Computation of Local Interchangeability in Soft Const... |
ACMICEC
2006
ACM
13 years 11 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...
WG
2005
Springer
13 years 10 months ago
2005
Springer
SAC
2000
ACM
13 years 8 months ago
2000
ACM
CONSTRAINTS
2008
13 years 5 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...
CP
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...