Pages that link to "Item:Q1370620"
From MaRDI portal
The following pages link to Fast algebraic methods for interval constraint problems (Q1370620):
Displaying 14 items.
- Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra (Q354605) (← links)
- A reinforcement learning approach to interval constraint propagation (Q941660) (← links)
- Interval propagation and search on directed acyclic graphs for numerical constraint solving (Q1041436) (← links)
- Reasoning about qualitative temporal information (Q1204871) (← links)
- Relation algebras and their application in temporal and spatial reasoning (Q1781107) (← links)
- Algorithmic power from declarative use of redundant constraints (Q1969732) (← links)
- Collective singleton-based consistency for qualitative constraint networks: theory and practice (Q2334596) (← links)
- Modelling and solving temporal reasoning as propositional satisfiability (Q2389682) (← links)
- Solving kinematics problems by efficient interval partitioning (Q2443368) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- Deciding the consistency of branching time interval networks (Q5079779) (← links)
- Analytic constraint solving and interval arithmetic (Q5178863) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308413) (← links)
- (Q6060092) (← links)