The following pages link to Numerica (Q33038):
Displaying 41 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- Interval-based projection method for under-constrained numerical systems (Q487645) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Constraint propagation on quadratic constraints (Q606897) (← links)
- Simulation of discrete linear time-invariant fuzzy dynamic systems (Q835082) (← links)
- Contractor programming (Q840818) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Termination of floating-point computations (Q850498) (← links)
- Formulation for reliable analysis of structural frames (Q868692) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- CPBPV: a constraint-programming framework for bounded program verification (Q968353) (← links)
- Local consistency for extended CSPs (Q1035707) (← links)
- An interval component for continuous constraints. (Q1421218) (← links)
- Accelerating filtering techniques for numeric CSPs (Q1606118) (← links)
- A certified branch \& bound approach for reliability-based optimization problems (Q1679494) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A microkernel architecture for constraint programming (Q1706769) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- Safe and tight linear estimators for global optimization (Q1774166) (← links)
- A rigorous global filtering algorithm for quadratic constraints (Q1774519) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- Consistency techniques in ordinary differential equations (Q1871969) (← links)
- Set-membership state estimation with fleeting data (Q1941265) (← links)
- Localizer (Q1975204) (← links)
- Actions of the hyperoctahedral group to compute minimal contractors (Q2093397) (← links)
- Exclusion regions for optimization problems (Q2250096) (← links)
- Improving inter-block backtracking with interval Newton (Q2267807) (← links)
- A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
- Some observations on exclusion regions in branch and bound algorithms (Q2349518) (← links)
- Range-only SLAM with indistinguishable landmarks; a constraint programming approach (Q2398514) (← links)
- Thick set inversion (Q2409673) (← links)
- A generic interval branch and bound algorithm for parameter estimation (Q2416576) (← links)
- Solving kinematics problems by efficient interval partitioning (Q2443368) (← links)
- Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
- An analysis of arithmetic constraints on integer intervals (Q2460254) (← links)
- Computing the pessimism of inclusion functions (Q2481139) (← links)
- Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem (Q2484023) (← links)
- Validated constraints solving --- practicalities, pitfalls, and new developments (Q2568645) (← links)
- Constraint and Integer Programming in OPL (Q2884541) (← links)
- Interval computations, rigour and non-rigour in deterministic continuous global optimization (Q3093044) (← links)
- Integrating Finite Domain and Set Constraints into a Set-based Constraint Language (Q3400565) (← links)
