The following pages link to (Q4249563):
Displaying 14 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Reachability computation for polynomial dynamical systems (Q526433) (← links)
- Reconstructing orthogonal polyhedra from putative vertex sets (Q634249) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
- Computing the discrete compactness of orthogonal pseudo-polytopes via their \(n\)D-EVM representation (Q1958864) (← links)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro} (Q2105429) (← links)
- Local orientation-preserving symmetry preserving operations on polyhedra (Q2219948) (← links)
- Data structures for higher-dimensional rectilinear packing (Q2815459) (← links)
- Computation of the axial view of a set of isothetic parallelepipeds (Q3359800) (← links)
- Approximating Continuous Systems by Timed Automata (Q3506869) (← links)
- CARTESIAN PRODUCT PARTITIONING OF MULTI-DIMENSIONAL REACHABLE STATE SPACES (Q5358087) (← links)
- DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES (Q5426828) (← links)
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra (Q5458327) (← links)
