Algorithmic power from declarative use of redundant constraints
From MaRDI portal
Publication:1969732
DOI10.1023/A:1009821007410zbMath0949.68041MaRDI QIDQ1969732
Publication date: 19 March 2000
Published in: Constraints (Search for Journal in Brave)
Related Items (6)
Range-only SLAM with indistinguishable landmarks; a constraint programming approach ⋮ Solving set-valued constraint satisfaction problems ⋮ Set-membership state estimation with fleeting data ⋮ Combining interval analysis with flatness theory for state estimation of sailboat robots ⋮ Probabilistic set-membership approach for robust regression ⋮ Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
Uses Software
This page was built for publication: Algorithmic power from declarative use of redundant constraints
