Guaranteed Set Computation with Subpavings
From MaRDI portal
Publication:4577113
DOI10.1007/978-1-4757-6484-0_14zbMath1391.93005OpenAlexW36357499MaRDI QIDQ4577113
Isabelle Braems, Michel Kieffer, Jaulin, Luc, Éric Walter
Publication date: 16 July 2018
Published in: Scientific Computing, Validated Numerics, Interval Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4757-6484-0_14
Related Items (2)
Solving set-valued constraint satisfaction problems ⋮ Minimum distance histograms with universal performance guarantees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Set inversion via interval analysis for nonlinear bounded-error estimation
- PROFIL/BIAS - A fast interval library
- Robust autonomous robot localization using interval analysis
- Guaranteed non-linear estimation using constraint propagation on sets
- Exact recursive polyhedral description of the feasible parameter set for bounded-error models
- Guaranteed recursive non-linear state bounding using interval analysis
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
This page was built for publication: Guaranteed Set Computation with Subpavings