Koc University Digital Collections
metadata only
Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling
In this paper we use counting arguments to prove that the expected percentage coverage of a d dimensional parameter space of size n when performing k trials with either Latin Hypercube sampling or Orthogonal Array-based Latin Hypercube sampling is the same. We then extend these results to an experim
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Concentration of the hypergraph's weak independence number#924465
- Concentration of the hypergraph's weak independence number#920234
- Saturation and Localization Results for Max-product Generalized Sampling Operators based on Centered Bell-shaped Kernels#998709
- Optimality of meta-converse for channel simulation#243790
- On random disc-polygons in a disc-polygon#131173
Record · ID 955423
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive