Pages that link to "Item:Q4292120"

The following pages link to Orthogonal Array-Based Latin Hypercubes (Q4292120):

Displaying 50 items.

• Calibration for computer experiments with binary responses and application to cell adhesion study (Q149466) (← links)
• A generalized Gaussian process model for computer experiments with binary time series (Q153075) (← links)
• Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (Q319710) (← links)
• Construction of uniform \(U\)-designs (Q337682) (← links)
• Construction of nested orthogonal arrays of parallel-flats type (Q337689) (← links)
• Subset selection from large datasets for kriging modeling (Q381304) (← links)
• Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions (Q381435) (← links)
• An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions (Q381689) (← links)
• Resolvable orthogonal array-based uniform sliced Latin hypercube designs (Q395979) (← links)
• Projection array based designs for computer experiments (Q434561) (← links)
• Accurate emulators for large-scale computer experiments (Q449978) (← links)
• A characterization of strong orthogonal arrays of strength three (Q464184) (← links)
• On the construction of nested space-filling designs (Q464188) (← links)
• Optimum design accounting for the global nonlinear behavior of the model (Q464189) (← links)
• Space-filling Latin hypercube designs based on randomization restrictions in factorial experiments (Q467037) (← links)
• Sliced space-filling designs with different levels of two-dimensional uniformity (Q473525) (← links)
• Nearly column-orthogonal designs based on leave-one-out good lattice point sets (Q514180) (← links)
• Algorithms for generating maximin Latin hypercube and orthogonal designs (Q539823) (← links)
• Follow-up experimental designs for computer models and physical processes (Q539835) (← links)
• Orthogonal designs for computer experiments (Q622447) (← links)
• Block-circulant matrices for constructing optimal Latin hypercube designs (Q629134) (← links)
• Design of computer experiments: space filling and beyond (Q693293) (← links)
• Optimizing Latin hypercube designs by particle swarm (Q746308) (← links)
• Efficient emulators of computer experiments using compactly supported correlation functions, with an application to cosmology (Q765992) (← links)
• Approximate solutions of continuous dispersion problems (Q816409) (← links)
• Optimization of a large-scale water reservoir network by stochastic dynamic programming with efficient state space discretization (Q819117) (← links)
• Efficient emulators for scattering using eigenvector continuation (Q822356) (← links)
• Construction of space-filling orthogonal designs (Q830715) (← links)
• Neural network and regression spline value function approximations for stochastic dynamic programming (Q850310) (← links)
• Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search (Q933803) (← links)
• A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments (Q939670) (← links)
• Orthogonal-column Latin hypercube designs with small samples (Q961256) (← links)
• Recent developments in nonregular fractional factorial designs (Q975573) (← links)
• Construction of orthogonal Latin hypercube designs with flexible run sizes (Q989244) (← links)
• Orthogonal Latin hypercube designs from generalized orthogonal designs (Q999010) (← links)
• \(\mathcal G\)-SELC: optimization by sequential elimination of level combinations using genetic algorithms and Gaussian processes (Q1018629) (← links)
• Construction of nested space-filling designs (Q1043757) (← links)
• On the asymptotic distribution of scrambled net quadrature. (Q1434015) (← links)
• Algorithmic construction of optimal symmetric Latin hypercube designs. (Q1587202) (← links)
• Polynomial chaos expansion approach to interest rate models (Q1657904) (← links)
• Sequential design strategies for mean response surface metamodeling via stochastic kriging with adaptive exploration and exploitation (Q1683081) (← links)
• A central limit theorem for marginally coupled designs (Q1726865) (← links)
• Uniform projection designs (Q1731775) (← links)
• Strong orthogonal arrays of strength two plus (Q1750274) (← links)
• A combinatorial central limit theorem for randomized orthogonal array sampling designs (Q1816980) (← links)
• Construction of column-orthogonal designs for computer experiments (Q1934552) (← links)
• Setting targets for surrogate-based optimization (Q1942023) (← links)
• A new class of Latin hypercube designs with high-dimensional hidden projective uniformity (Q1946947) (← links)
• A novel fractional moments-based maximum entropy method for high-dimensional reliability analysis (Q1985152) (← links)
• Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs (Q1990600) (← links)