Pages that link to "Item:Q2485987"
From MaRDI portal
The following pages link to An efficient algorithm for constructing optimal design of computer experiments (Q2485987):
Displaying 23 items.
- Uncertainty Quantification of Store-Separation Simulation Due to Ejector Modeling Using a Monte Carlo Approach with Kriging Model (Q5077116) (← links)
- A novel extension algorithm for optimized Latin hypercube sampling (Q5106950) (← links)
- (Q5159421) (← links)
- Space-filling orthogonal arrays of strength two (Q5220794) (← links)
- Maximum projection designs for computer experiments (Q5258429) (← links)
- (Q5386573) (← links)
- Estimation of the Derivative-Based Global Sensitivity Measures Using a Gaussian Process Metamodel (Q5741198) (← links)
- An algorithm for the simultaneous construction of<i>D</i>-optimal experimental designs (Q6082983) (← links)
- Non‐intrusive reduced‐order modeling using convolutional autoencoders (Q6092270) (← links)
- Surrogate-based optimization with adaptive parallel infill strategy enhanced by inaccurate multi-objective search (Q6094531) (← links)
- Data-driven and physics-based modelling of process behaviour and deposit geometry for friction surfacing (Q6118502) (← links)
- Optimal design of experiments for hypothesis testing on ordered treatments via intersection-union tests (Q6157033) (← links)
- A new rotation method for constructing orthogonal Latin hypercube designs (Q6158015) (← links)
- Isovolumetric adaptations to space-filling design of experiments (Q6173800) (← links)
- A latent variable approach for non-hierarchical multi-fidelity adaptive sampling (Q6202955) (← links)
- A sequential optimal Latin hypercube design method using an efficient recursive permutation evolution algorithm (Q6495533) (← links)
- An adaptive sampling algorithm for reduced-order models using isomap (Q6499911) (← links)
- Efficient prediction designs for random fields (Q6574704) (← links)
- Space-filling designs with a Dirichlet distribution for mixture experiments (Q6581290) (← links)
- An integer programming algorithm for constructing maximin distance designs from good lattice point sets (Q6593366) (← links)
- Controlling Sources of Inaccuracy in Stochastic Kriging (Q6621645) (← links)
- An Information Geometry Approach to Robustness Analysis for the Uncertainty Quantification of Computer Codes (Q6631047) (← links)
- Modification of the Maximin and <i>ϕ</i><sub><i>p</i></sub> (Phi) Criteria to Achieve Statistically Uniform Distribution of Sampling Points (Q6636554) (← links)