Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Constraint programming
Constraint satisfaction problem
Preference-based planning
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A User Behavior-Based Approach to Detect the Insider Threat in Distributed Diagnostic Imaging Systems
Hassan Sharghi
,
K. Sartipi
IEEE 29th International Symposium on Computer…
2016
Corpus ID: 9302545
A modern diagnostic imaging system integrates several PACS (Picture Archiving and Communication System) through datacenters that…
Expand
2015
2015
Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction
Arnaud Lallouet
,
Jimmy Ho-man Lee
,
Terrence W.K. Mak
,
Justin Yip
Constraints
2015
Corpus ID: 2559469
The task at hand is that of a soft constraint problem with adversarial conditions. By amalgamating the weighted and quantified…
Expand
2014
2014
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains
Hannes Uppman
Symposium on Theoretical Aspects of Computer…
2014
Corpus ID: 8889069
In this paper we study the computational complexity of the extended minimum cost homomorphism problem (Min-Cost-Hom) as a…
Expand
2013
2013
Linear Programming and the Complexity of Finite-valued CSPs ∗
Johan Thapper
2013
Corpus ID: 18891393
We consider the complexity classification project for the valued constraint satisfaction problem (VCSP) restricted to rational…
Expand
2012
2012
Constraint Optimization Problems and Bounded Tree-Width Revisited
Tommy Färnqvist
Integration of AI and OR Techniques in Constraint…
2012
Corpus ID: 400692
The valued constraint satisfaction problem (VCSP) is an optimization framework originating from artificial intelligence which…
Expand
2011
2011
Weighted Constraint Satisfaction Problems with Min-Max Quantifiers
Jimmy Ho-man Lee
,
Terrence W.K. Mak
,
Justin Yip
IEEE International Conference on Tools with…
2011
Corpus ID: 13359584
Soft constraints are functions returning costs, and are essential in modeling over-constrained and optimization problems. We are…
Expand
2007
2007
Minimization of locally-de(cid:12)ned submodular functions by optimal soft arc consistency
Martin C. Cooper
2007
Corpus ID: 16551897
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose…
Expand
2007
2007
An Amalgamated Dynamic and Static Architecture Reconstruction Framework to Control Component Interactions 259
K. Sartipi
,
N. Dezhkam
Working Conference on Reverse Engineering
2007
Corpus ID: 2835410
View-based software development is well adopted in for techniques still consider a single view of a software system with…
Expand
2006
2006
An Adaptive System to Control Consumer Electronics Based on Earthquake Early Warning
T. Kokawa
,
R. Sakamoto
,
Hitoshi Ogawa
,
V. Kryssanov
International Conference on e-Business
2006
Corpus ID: 4884075
A tear resistant film comprises at least three layers situated one on the other in a parallel array. The layers are individually…
Expand
2001
2001
New hybrid method for solving constraint optimization problems in anytime contexts
S. Loudni
,
P. Boizumault
Proceedings 13th IEEE International Conference on…
2001
Corpus ID: 32668564
This paper describes a new hybrid method for solving constraint optimization problems in anytime contexts. We use the valued…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE