Pages that link to "Item:Q1424768"

The following pages link to Boosting search with variable elimination in constraint optimization and constraint satisfaction problems (Q1424768):

Displaying 50 items.

• Propagation via lazy clause generation (Q2272160) (← links)
• Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
• Sufficient and necessary conditions for solution finding in valuation-based systems (Q2302788) (← links)
• Online control of enumeration strategies via bat algorithm and black hole optimization (Q2311317) (← links)
• MiniBrass: soft constraints for MiniZinc (Q2331099) (← links)
• On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
• Variable and value elimination in binary constraint satisfaction via forbidden patterns (Q2353394) (← links)
• Partition search for non-binary constraint satisfaction (Q2372239) (← links)
• A logical approach to efficient Max-SAT solving (Q2389619) (← links)
• Efficient algorithms for singleton arc consistency (Q2430358) (← links)
• A constraint-based approach for annotating music scores with gestural information (Q2460252) (← links)
• Towards constraint-based school timetabling (Q2468741) (← links)
• Towards a practical engineering tool for rostering (Q2468743) (← links)
• Handling fuzzy temporal constraints in a planning environment (Q2468753) (← links)
• On global warming: Flow-based soft global constraints (Q2506232) (← links)
• Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
• Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP (Q2506238) (← links)
• Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited (Q2677344) (← links)
• Subsumption Algorithms for Three-Valued Geometric Resolution (Q2817925) (← links)
• Exploiting chordal structure in polynomial ideals: a Gröbner bases approach (Q2818203) (← links)
• Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO (Q2950522) (← links)
• Planning with Incomplete Information (Q3003424) (← links)
• Querying Regular Graph Patterns (Q3189642) (← links)
• Probabilistic TCP-net (Q3305128) (← links)
• Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
• Soft Constraints Processing over Divisible Residuated Lattices (Q3638207) (← links)
• HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
• Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211) (← links)
• The Broken-Triangle Property with Adjoint Values (Q4632206) (← links)
• Constraint Answer Set Solving (Q4649733) (← links)
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers (Q4649734) (← links)
• Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
• The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
• Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty. (Q5079775) (← links)
• On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier (Q5079776) (← links)
• Learning qualitative constraint networks (Q5079789) (← links)
• Dismantlability, Connectedness, and Mixing in Relational Structures (Q5091178) (← links)
• Algebras for Tree Decomposable Graphs (Q5100734) (← links)
• On Sparse Discretization for Graphical Games (Q5130000) (← links)
• Coalition formation in social environments with logic-based agents1 (Q5145446) (← links)
• Lazy Constraint Imposing for Improving the Path Constraint (Q5170285) (← links)
• Robust Solutions in Unstable Optimization Problems (Q5191410) (← links)
• Enumerating diagonal Latin squares of order up to 9 (Q5212149) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• Generalizing Global Constraints Based on Network Flows (Q5302729) (← links)
• A Global Filtration for Satisfying Goals in Mutual Exclusion Networks (Q5302730) (← links)
• Chordal Networks of Polynomial Ideals (Q5347294) (← links)
• A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems (Q5403428) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)