Pages that link to "Item:Q1818347"

The following pages link to Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison (Q1818347):

Displaying 50 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Interchangeability with thresholds and degradation factors for soft CSPs (Q353304) (← links)
• Global propagation of side constraints for solving over-constrained problems (Q545560) (← links)
• Possibilistic logic: a retrospective and prospective view (Q598572) (← links)
• Fuzzy Prolog: A new approach using soft constraints propagation (Q598583) (← links)
• Redundant modeling in permutation weighted constraint satisfaction problems (Q606896) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• Interleaving solving and elicitation of constraint satisfaction problems based on expected cost (Q606920) (← links)
• Interval-valued soft constraint problems (Q616770) (← links)
• On the modelling and optimization of preferences in constraint-based temporal reasoning (Q646549) (← links)
• Editorial: Fuzzy set and possibility theory-based methods in artificial intelligence (Q814478) (← links)
• Fuzzy \(rr\)DFCSP and planning (Q814480) (← links)
• Temporal scenario modelling and recognition based on possibilistic logic (Q814498) (← links)
• Arc consistency for soft constraints (Q814581) (← links)
• Cyclic consistency: A local reduction operation for binary valued constraints (Q814586) (← links)
• Solving weighted CSP by maintaining arc consistency (Q814626) (← links)
• Constraint solving in uncertain and dynamic environments: A survey (Q816686) (← links)
• High-order consistency in valued constraint satisfaction (Q816687) (← links)
• Stochastic constraint programming: A scenario-based approach (Q850457) (← links)
• Decision-support with preference constraints (Q857275) (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
• Subexponential concurrent constraint programming (Q897936) (← links)
• Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques (Q941662) (← links)
• The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies (Q969536) (← links)
• A note on some collapse results of valued constraints (Q987814) (← links)
• Representing interval orders by weighted bases: some complexity results (Q1042324) (← links)
• On the use of aggregation operations in information fusion processes. (Q1430884) (← links)
• Fuzzy constraint satisfaction problem for model-based image interpretation (Q1697321) (← links)
• Finding a given number of solutions to a system of fuzzy constraints (Q1745696) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• A hybrid framework for over-constrained generalized resource-constrained project scheduling problems (Q1768898) (← links)
• A framework for optimal correction of inconsistent linear constraints (Q1774520) (← links)
• Reduction operations in fuzzy or valued constraint satisfaction (Q1873182) (← links)
• The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP (Q2011611) (← links)
• Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs (Q2195978) (← links)
• Semiring programming: a semantic framework for generalized sum product problems (Q2206471) (← links)
• Zero divisors and prime elements of bounded semirings. (Q2258117) (← links)
• Lexicographically-ordered constraint satisfaction problems (Q2267804) (← links)
• MiniBrass: soft constraints for MiniZinc (Q2331099) (← links)
• Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
• Semiring induced valuation algebras: exact and approximate local computation algorithms (Q2389661) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• On-line resources allocation for ATM networks with rerouting (Q2489130) (← links)
• A logic of soft constraints based on partially ordered preferences (Q2506231) (← links)
• Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
• Hard and soft constraints for reasoning about qualitative conditional preferences (Q2506235) (← links)
• Integration and propagation of a multi-criteria decision making model in constraint programming (Q2506237) (← links)