Privacy sets for constrained space-filling
From MaRDI portal
Abstract: The paper provides typology for space filling into what we call "soft" and "hard" methods along with introducing the central notion of privacy sets for dealing with the latter. A heuristic algorithm based on this notion is presented and we compare its performance on some well-known examples.
Recommendations
Cites work
- scientific article; zbMATH DE number 3945143 (Why is no real title available?)
- scientific article; zbMATH DE number 5223070 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Exploratory designs for computational experiments
- Latin hypercube sampling with inequality constraints
- Maximum projection designs for computer experiments
This page was built for publication: Privacy sets for constrained space-filling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q254194)