scientific article
From MaRDI portal
Publication:2973329
zbMath1415.62059MaRDI QIDQ2973329
Publication date: 3 April 2017
Full work available at URL: http://journal-sfds.fr/article/view/601
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computer experimentssphere coveringsphere packingspace-filling designmaximin-optimal designminimax-optimal design
Optimal statistical designs (62K05) Design of statistical experiments (62K99) Minimax procedures in statistical decision theory (62C20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items (17)
Compressed Monte Carlo with application in particle filtering ⋮ A Framework for Controlling Sources of Inaccuracy in Gaussian Process Emulation of Deterministic Computer Experiments ⋮ Efficient quantisation and weak covering of high dimensional cubes ⋮ Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients ⋮ Quasi-uniform designs with optimal and near-optimal uniformity constant ⋮ Spreading points using gradient and tabu ⋮ Isovolumetric adaptations to space-filling design of experiments ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ Bayesian Quadrature, Energy Minimization, and Space-Filling Design ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences ⋮ Variance-based adaptive sequential sampling for polynomial chaos expansion ⋮ Measures minimizing regularized dispersion ⋮ Versatile sequential sampling algorithm using kernel density estimation ⋮ Chebyshev centres, Jung constants, and their applications ⋮ A Lipschitz Matrix for Parameter Reduction in Computational Science ⋮ Performance analysis of greedy algorithms for minimising a maximum mean discrepancy
This page was built for publication:
