Pages that link to "Item:Q814626"

The following pages link to Solving weighted CSP by maintaining arc consistency (Q814626):

Displaying 24 items.

• Tractability-preserving transformations of global cost functions (Q309935) (← links)
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
• Global propagation of side constraints for solving over-constrained problems (Q545560) (← links)
• Redundant modeling in permutation weighted constraint satisfaction problems (Q606896) (← links)
• Interleaving solving and elicitation of constraint satisfaction problems based on expected cost (Q606920) (← links)
• Probabilistic optimal solution assessment for DCOPs (Q722106) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• DARN! A weighted constraint solver for RNA motif localization (Q941671) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Clique inference process for solving Max-CSP (Q1042201) (← links)
• AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
• Triangle-based consistencies for cost function networks (Q1706773) (← links)
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
• Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction (Q2342595) (← links)
• Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction (Q2342646) (← links)
• Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
• A logical approach to efficient Max-SAT solving (Q2389619) (← links)
• Semiring induced valuation algebras: exact and approximate local computation algorithms (Q2389661) (← links)
• Computational protein design as an optimization problem (Q2453727) (← links)
• The complexity of soft constraint satisfaction (Q2457608) (← links)
• Comparing action descriptions based on semantic preferences (Q2457799) (← links)
• Solving finite domain constraint hierarchies by local consistency and tree search (Q3401378) (← links)
• Super-reparametrizations of weighted CSPs: properties and optimization perspective (Q6049436) (← links)
• Maximum feasibility estimation (Q6087374) (← links)