Pages that link to "Item:Q150636"
From MaRDI portal
The following pages link to Exploratory designs for computational experiments (Q150636):
Displayed 21 items.
- MOLHD (Q150645) (← links)
- Algorithms for generating maximin Latin hypercube and orthogonal designs (Q539823) (← links)
- A novel efficient method for real-time computation of parameterized dynamic equations with large-scale dimension (Q555678) (← links)
- Gaussian process emulation for second-order Monte Carlo simulations (Q629122) (← links)
- Approximate solutions of continuous dispersion problems (Q816409) (← links)
- Orthogonal-column Latin hypercube designs with small samples (Q961256) (← links)
- A new and flexible method for constructing designs for computer experiments (Q973874) (← links)
- Construction of orthogonal Latin hypercube designs with flexible run sizes (Q989244) (← links)
- Orthogonal Latin hypercube designs from generalized orthogonal designs (Q999010) (← links)
- Finding maximin Latin hypercube designs by iterated local search heuristics (Q1014951) (← links)
- Simplex based space filling designs (Q1044050) (← links)
- Bayesian emulation of complex multi-output and dynamic computer models (Q1044055) (← links)
- Algorithmic construction of optimal symmetric Latin hypercube designs. (Q1587202) (← links)
- Optimal exact experimental designs with correlated errors through a simulated annealing algorithm (Q1606469) (← links)
- One-dimensional nested maximin designs (Q2269596) (← links)
- Batch sequential designs for computer experiments (Q2270267) (← links)
- An efficient algorithm for constructing optimal design of computer experiments (Q2485987) (← links)
- A study on algorithms for optimization of Latin hypercubes (Q2498770) (← links)
- A novel multi-objective optimization method based on an approximation model management technique (Q2637999) (← links)
- Estimating Percentiles of Uncertain Computer Code Outputs (Q3435791) (← links)
- An algorithm for fast optimal Latin hypercube design of experiments (Q3567270) (← links)