𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Estimating the Characteristics of the Accuracy and Computational Complexity in Approximate Methods of Global Optimization of Nonlinear Functionals

✍ Scribed by Babich, M. D.; Getsko, A. M.

Book ID
121564248
Publisher
Springer US
Year
2014
Tongue
English
Weight
117 KB
Volume
50
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computational complexity of planning and
Computational complexity of planning and approximate planning in the presence of incompleteness
✍ Chitta Baral; Vladik Kreinovich; RaΓΊl Trejo πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 213 KB

In the last several years, there have been several studies about the computational complexity of classical planning assuming that the planner has complete knowledge about the initial situation. Recently, there have been proposals to use 'sensing' actions to plan in the presence of incompleteness. In

The Accuracy and the Computational Compl
The Accuracy and the Computational Complexity of a Multivariate Binned Kernel Density Estimator
✍ Lasse HolmstrΓΆm πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 475 KB

The computational cost of multivariate kernel density estimation can be reduced by prebinning the data. The data are discretized to a grid and a weighted kernel estimator is computed. We report results on the accuracy of such a binned kernel estimator and discuss the computational complexity of the