Pages that link to "Item:Q2799900"

The following pages link to Latin hypercubes and space-filling designs (Q2799900):

Displaying 42 items.

• Exploratory designs for computational experiments (Q150636) (← links)
• Privacy sets for constrained space-filling (Q254194) (← links)
• Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments (Q467037) (← links)
• The depth-design: an efficient generation of high dimensional computer experiments (Q499435) (← links)
• A standardized distance-based index to assess the quality of space-filling designs (Q518233) (← links)
• Formulation of the Audze-Eglais uniform Latin hypercube design of experiments for constrained design spaces (Q654380) (← links)
• Design of computer experiments: space filling and beyond (Q693293) (← links)
• Simplex based space filling designs (Q1044050) (← links)
• Uniform projection designs (Q1731775) (← links)
• Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs (Q1990600) (← links)
• Optimal Latin hypercube designs for the Kullback-Leibler criterion (Q2006878) (← links)
• Comparing and generating Latin hypercube designs in kriging models (Q2006879) (← links)
• Connecting U-type designs before and after level permutations and expansions (Q2063873) (← links)
• Construction of orthogonal marginally coupled designs (Q2065307) (← links)
• Asymptotically optimal maximin distance Latin hypercube designs (Q2124784) (← links)
• Construction of group strong orthogonal arrays of strength two plus (Q2150891) (← links)
• On maximin distance and nearly orthogonal Latin hypercube designs (Q2216956) (← links)
• Optimal maximin \(L_2\)-distance Latin hypercube designs (Q2301107) (← links)
• Construction of marginally coupled designs by subspace theory (Q2419673) (← links)
• Space-filling Latin hypercube designs for computer experiments (Q2443402) (← links)
• Comparison of designs for computer experiments (Q2581665) (← links)
• Construction of uniform projection designs via level permutation and expansion (Q2676908) (← links)
• A general construction for space-filling Latin hypercubes (Q2796875) (← links)
• Probability-based Latin hypercube designs for slid-rectangular regions (Q3067020) (← links)
• Multi-Layer Designs for Computer Experiments (Q3111204) (← links)
• GENERATING A MAXIMALLY SPACED SET OF BINS TO FILL FOR HIGH-DIMENSIONAL SPACE-FILLING LATIN HYPERCUBE SAMPLING (Q3173745) (← links)
• Sudoku-based space-filling designs (Q3174198) (← links)
• A Census of Small Latin Hypercubes (Q3629471) (← links)
• (Q5449153) (← links)
• EzGP: Easy-to-Interpret Gaussian Process Models for Computer Experiments with Both Quantitative and Qualitative Factors (Q5858428) (← links)
• Maximum expected entropy transformed Latin hypercube designs (Q5861463) (← links)
• Latin hypercube designs based on strong orthogonal arrays and Kriging modelling to improve the payload distribution of trains (Q5861530) (← links)
• On Design Orthogonality, Maximin Distance, and Projection Uniformity for Computer Experiments (Q5881091) (← links)
• Two‐dimensional projection uniformity for space‐filling designs (Q6059446) (← links)
• Optimization over decision trees: a case study for the design of stable direct-current electricity networks (Q6088547) (← links)
• A new rotation method for constructing orthogonal Latin hypercube designs (Q6158015) (← links)
• On the maximin distance properties of orthogonal designs via the rotation (Q6174103) (← links)
• New bounds and search for maximin distance U-type designs (Q6548922) (← links)
• Deterministic sampling based on Kullback-Leibler divergence and its applications (Q6579383) (← links)
• Column expanded Latin hypercube designs (Q6616198) (← links)
• Distance-Distributed Design for Gaussian Process Surrogates (Q6631860) (← links)
• A construction method for maximin \(L_1\)-distance Latin hypercube designs (Q6671916) (← links)