Skip to search formSkip to main contentSkip to account menu

Weighted constraint satisfaction problem

Known as: Valued constraint satisfaction problem 
Whereas all constraints in a constraint satisfaction problem (CSP) must be satisfied, a Weighted Constraint Satisfaction Problem (WCSP) is a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A modern diagnostic imaging system integrates several PACS (Picture Archiving and Communication System) through datacenters that… 
2015
2015
The task at hand is that of a soft constraint problem with adversarial conditions. By amalgamating the weighted and quantified… 
2014
2014
In this paper we study the computational complexity of the extended minimum cost homomorphism problem (Min-Cost-Hom) as a… 
2013
2013
We consider the complexity classification project for the valued constraint satisfaction problem (VCSP) restricted to rational… 
2012
2012
The valued constraint satisfaction problem (VCSP) is an optimization framework originating from artificial intelligence which… 
2011
2011
Soft constraints are functions returning costs, and are essential in modeling over-constrained and optimization problems. We are… 
2007
2007
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose… 
2007
2007
View-based software development is well adopted in for techniques still consider a single view of a software system with… 
2006
2006
A tear resistant film comprises at least three layers situated one on the other in a parallel array. The layers are individually… 
2001
2001
This paper describes a new hybrid method for solving constraint optimization problems in anytime contexts. We use the valued…