Method for constructing optimal dark coverings
From MaRDI portal
Recommendations
- Application of probability methods to the problem of construction of optimal coverings
- Approximation of completely bounded sets by the deep holes method.
- Algorithms for constructing optimal \(n\)-networks in metric spaces
- On the complexity of asymptotically optimal coverings and packings
- Algorithms of the best approximations of the flat sets by the union of circles
Cites work
- A Mathematical Theory of Communication
- Approximation of completely bounded sets by the deep holes method.
- scientific article; zbMATH DE number 3147888 (Why is no real title available?)
- scientific article; zbMATH DE number 5729198 (Why is no real title available?)
- scientific article; zbMATH DE number 46645 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 1105179 (Why is no real title available?)
- scientific article; zbMATH DE number 3802533 (Why is no real title available?)
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Study of convergence rate and efficiency of two-phase methods for approximating the Edgeworth-Pareto hull
This page was built for publication: Method for constructing optimal dark coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991636)