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):
Displaying 50 items.
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- On minimal constraint networks (Q359976) (← links)
- Concurrent forward bounding for distributed constraint optimization problems (Q359999) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- 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)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Formulating the template ILP consistency problem as a constraint satisfaction problem (Q487650) (← links)
- Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- How to deal with unbelievable assertions (Q524943) (← 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)
- A polynomial relational class of binary CSP (Q722101) (← links)
- High-order consistency in valued constraint satisfaction (Q816687) (← links)
- Solving connected row convex constraints by variable elimination (Q840826) (← 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)
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← 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 mixed heuristic for generating cocyclic Hadamard matrices (Q1616208) (← links)
- Obligation as optimal goal satisfaction (Q1670486) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Graphical models for optimal power flow (Q1701228) (← links)
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (Q1706596) (← links)
- Combining restarts, nogoods and bag-connected decompositions for solving csps (Q1706771) (← links)
- A complete solution to the maximum density still life problem (Q1761276) (← links)
- Relational networks of conditional preferences (Q1945137) (← links)
- Weight-based heuristics for constraint satisfaction and combinatorial optimization problems (Q1951176) (← links)
- Review on nature-inspired algorithms (Q1981936) (← links)
- Sharpening constraint programming approaches for bit-vector theory (Q2011567) (← links)
- Dynamic temporal decoupling (Q2011608) (← links)
- Accelerating backtrack search with a best-first-search strategy (Q2018417) (← links)
- ProCount: weighted projected model counting with graded project-join trees (Q2118296) (← links)
- Nature-inspired techniques for dynamic constraint satisfaction problems (Q2139357) (← links)
- Popularity-similarity random SAT formulas (Q2238712) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
