Pages that link to "Item:Q5282127"
From MaRDI portal
The following pages link to Approximating Viability Kernels With Support Vector Machines (Q5282127):
Displaying 14 items.
- Comparison theorem for viability kernels via conic preorders (Q826792) (← links)
- Shadowing and the viability kernel algorithm (Q843970) (← links)
- A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves (Q905994) (← links)
- The computation of the viability kernel for switched systems (Q1713546) (← links)
- Viable immersion and invariance control for a class of nonlinear systems and its application to aero-engines (Q1757482) (← links)
- The viability kernel of dynamical systems with mixed constraints: a level-set approach (Q2327365) (← links)
- Lagrangian methods for approximating the viability kernel in high-dimensional systems (Q2356655) (← links)
- Computation of viability kernels: a case study of by-catch fisheries (Q2438092) (← links)
- Capture basin approximation using interval analysis (Q3008834) (← links)
- Determining the Viable Unbounded Polyhedron Under Linear Control Systems (Q5172944) (← links)
- SVM Approximation of Value Function Contours in Target Hitting Problems (Q5245422) (← links)
- On the computation of the robust viability kernel for switched systems (Q6583172) (← links)
- Solving viability problems in dynamic games using individual strategies derived from guaranteed viability kernels: application to an agricultural cooperative model (Q6585400) (← links)
- Determining the viability of an unbounded polyhedron for a switched system (Q6607631) (← links)
