Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 35 results in range #1 to #35.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Strong Controllability of Disjunctive Temporal Problems with Uncertainty: Label: en
  2. CP-Based Local Branching: Label: en
  3. Groupoids and Conditional Symmetry: Label: en
  4. The Log-Support Encoding of CSP into SAT: Label: en
  5. The Expressive Power of Valued Constraints: Hierarchies and Collapses: Label: en
  6. An Analysis of Slow Convergence in Interval Propagation: Label: en
  7. Solution Counting Algorithms for Constraint-Centered Search Heuristics: Label: en
  8. Filtering for Subgraph Isomorphism: Label: en
  9. Hierarchical Hardness Models for SAT: Label: en
  10. On Universal Restart Strategies for Backtracking Search: Label: en
  11. A Cost-Based Model and Algorithms for Interleaving Solving and Elicitation of CSPs: Label: en
  12. An LP-Based Heuristic for Optimal Planning: Label: en
  13. Constructive Interval Disjunction: Label: en
  14. Decomposing Global Grammar Constraints: Label: en
  15. Propagation = Lazy Clause Generation: Label: en
  16. AND/OR Multi-valued Decision Diagrams for Constraint Optimization: Label: en
  17. Towards Robust CNF Encodings of Cardinality Constraints: Label: en
  18. Scheduling Conditional Task Graphs: Label: en
  19. Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance: Label: en
  20. Path Consistency by Dual Consistency: Label: en
  21. Breaking Symmetry of Interchangeable Variables and Values: Label: en
  22. Valid Inequality Based Lower Bounds for WCSP: Label: en
  23. Dynamic Management of Heuristics for Solving Structured CSPs: Label: en
  24. Limitations of Restricted Branching in Clause Learning: Label: en
  25. MUST: Provide a Finer-Grained Explanation of Unsatisfiability: Label: en
  26. Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure: Label: en
  27. Dealing with Incomplete Preferences in Soft Constraint Problems: Label: en
  28. Tradeoffs in the Complexity of Backdoor Detection: Label: en
  29. An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming: Label: en
  30. On Inconsistent Clause-Subsets for Max-SAT Solving: Label: en
  31. Encodings of the Sequence Constraint: Label: en
  32. Local Symmetry Breaking During Search in CSPs: Label: en
  33. Solution Directed Backjumping for QCSP: Label: en
  34. GAC Via Unit Propagation: Label: en
  35. Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)