Privacy sets for constrained space-filling

DOI10.1016/j.jspi.2015.12.004zbMath1336.62227arXiv1510.05284OpenAlexW2963699794MaRDI QIDQ254194

Eva Benková, Radoslav Harman, Werner G. Müller

Publication date: 8 March 2016

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.05284

zbMATH Keywords

optimal designcomputer experimentsdesign algorithms

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Design of statistical experiments (62K99) Factorial statistical designs (62K15)

Related Items (1)

10 Kriging: methods and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Exploratory designs for computational experiments
• Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
• Latin hypercube sampling with inequality constraints
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Maximum projection designs for computer experiments

This page was built for publication: Privacy sets for constrained space-filling