Bounding the errors for convex dynamics on one or more polytopes
From MaRDI portal
Publication:3636596
Cites work
- A decoding problem in dynamics and in number theory
- Approximating a bandlimited function using very coarsely quantized data: a family of stable sigma-delta modulators of arbitrary order
- Convex dynamics and applications
- Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
- Convex dynamics: properties of invariant sets
- Dynamic of error diffusion on several polytopes
- Fairness in Scheduling
- Interval exchange transformations
- On a distribution problem in finite and countable sets
- State Constraints in Convex Control Problems of Bolza
- Symbolic Dynamics II. Sturmian Trajectories
- The Chairman assignment problem
- The optimality of the online greedy algorithm in carpool and chairman assignment problems
Cited in
(4)
This page was built for publication: Bounding the errors for convex dynamics on one or more polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636596)