The following pages link to Contractor programming (Q840818):
Displaying 47 items.
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (Q312490) (← links)
- An interval extension based on occurrence grouping (Q411420) (← links)
- Solving set-valued constraint satisfaction problems (Q411438) (← links)
- Determination of set-membership identifiability sets (Q475428) (← links)
- Phase based localization for underwater vehicles using interval analysis (Q475449) (← links)
- Solving non-linear constraint satisfaction problems involving time-dependent functions (Q475451) (← links)
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- Set-membership identifiability of nonlinear models and related parameter estimation properties (Q511376) (← links)
- Construction of parametric barrier functions for dynamical systems using interval analysis (Q518335) (← links)
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers (Q721162) (← links)
- Adaptive constructive interval disjunction: algorithms and experiments (Q903916) (← links)
- A global constraint for over-approximation of real-time streams (Q1699526) (← links)
- A greedy approach for a rolling stock management problem using multi-interval constraint propagation. A greedy approach for a rolling stock management problem using multi-interval constraint propagation, ROADEF/EURO challenge 2014 (Q1730606) (← links)
- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation (Q1737666) (← links)
- Reliable nonlinear state estimation involving time uncertainties (Q1797035) (← links)
- Set-membership state estimation with fleeting data (Q1941265) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
- Computation of robust capture zones using interval-based viability techniques in presence of state uncertainties (Q2087116) (← links)
- Actions of the hyperoctahedral group to compute minimal contractors (Q2093397) (← links)
- Improving inter-block backtracking with interval Newton (Q2267807) (← links)
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms (Q2274873) (← links)
- The octagon abstract domain for continuous constraints (Q2342596) (← links)
- Range-only SLAM with indistinguishable landmarks; a constraint programming approach (Q2398514) (← links)
- Constrained global optimization for wine blending (Q2398517) (← links)
- Thick set inversion (Q2409673) (← links)
- A generic interval branch and bound algorithm for parameter estimation (Q2416576) (← links)
- Bracketing the solutions of an ordinary differential equation with uncertain initial conditions (Q2422853) (← links)
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems (Q2423791) (← links)
- Set-valued state estimation of nonlinear discrete-time systems with nonlinear invariants based on constrained zonotopes (Q2665141) (← links)
- Bounded-error state and parameter estimation of tip-tilt disturbances in adaptive optics systems (Q2802386) (← links)
- Computing Capture Tubes (Q2803603) (← links)
- Exploiting binary floating-point representations for constraint propagation (Q2806863) (← links)
- Contractors for flows (Q2857376) (← links)
- A new interval-based method to characterize estimability (Q3008836) (← links)
- Bracketing backward reach sets of a dynamical system (Q3386553) (← links)
- Fuzzy Matrix Contractor Based Approach for Localization of Robots (Q5379802) (← links)
- Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)
- A new methodology for solving fuzzy systems of equations: thick fuzzy sets based approach (Q6058080) (← links)
- Inner and outer characterization of the projection of polynomial equations using symmetries, quotients and intervals (Q6116524) (← links)
- Example Guided Synthesis of Linear Approximations for Neural Network Verification (Q6487316) (← links)
- LinSyn: synthesizing tight linear bounds for arbitrary neural network activation functions (Q6535572) (← links)
- Interval constraint programming for globally solving catalog-based categorical optimization (Q6541384) (← links)
- Validated B-series and Runge-Kutta pairs (Q6559441) (← links)
- Set inversion and box contraction on Lie groups using interval analysis (Q6566771) (← links)
- Robust set-membership state estimator against outliers in data (Q6608906) (← links)
- Sparse tensors and subdivision methods for finding the zero set of polynomial equations (Q6660334) (← links)
