Pages that link to "Item:Q1424768"
From MaRDI portal
The following pages link to Boosting search with variable elimination in constraint optimization and constraint satisfaction problems (Q1424768):
Displayed 44 items.
- Block-wise construction of tree-like relational features with monotone reducibility and redundancy (Q413862) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- STR2: optimized simple tabular reduction for table constraints (Q429802) (← links)
- Global propagation of side constraints for solving over-constrained problems (Q545560) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Discovering implied constraints in precedence graphs with alternatives (Q613781) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- High-order consistency in valued constraint satisfaction (Q816687) (← links)
- Mixed deterministic and probabilistic networks (Q841632) (← links)
- Min-domain retroactive ordering for asynchronous backtracking (Q842785) (← links)
- New filtering algorithms for combinations of among constraints (Q842795) (← links)
- On the separability of subproblems in Benders decompositions (Q846136) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- Dynamic ordering for asynchronous backtracking on DisCSPs (Q850468) (← links)
- Symbolic techniques in satisfiability solving (Q862403) (← links)
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques (Q941662) (← links)
- A qualitative dynamical modelling approach to capital accumulation in unregulated fisheries (Q959698) (← links)
- A large neighbourhood search approach to the multi-activity shift scheduling problem (Q972651) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- A complete solution to the maximum density still life problem (Q1761276) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Propagation via lazy clause generation (Q2272160) (← 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)
- Planning with Incomplete Information (Q3003424) (← 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)
- Constraint Answer Set Solving (Q4649733) (← links)
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers (Q4649734) (← links)
- Robust Solutions in Unstable Optimization Problems (Q5191410) (← links)
- Generalizing Global Constraints Based on Network Flows (Q5302729) (← links)
- A Global Filtration for Satisfying Goals in Mutual Exclusion Networks (Q5302730) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)