Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
From MaRDI portal
Publication:5705387
Recommendations
Cites work
- A decoding problem in dynamics and in number theory
- An approach to renormalization on the n-torus
- Combinatorial computation of characteristic classes
- Dynamics of non-ergodic piecewise affine maps of the torus.
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- On a distribution problem in finite and countable sets
- Proportionate progress: A notion of fairness in resource allocation
- Renormalization on the n-dimensional torus
- The Chairman assignment problem
- The Wulff shape as the asymptotic limit of a growing crystalline interface
- The Wulff theorem revisited
- The isoperimetric theorem for general integrands
Cited in
(7)- Dynamic of error diffusion on several polytopes
- Convex dynamics with constant input
- Error diffusion on acute simplices: invariant tiles
- Convex dynamics and applications
- Bounding the errors for convex dynamics on one or more polytopes
- From greedy to lazy expansions and their driving dynamics
- Convex dynamics: properties of invariant sets
This page was built for publication: Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705387)