scientific article
From MaRDI portal
Publication:3498633
zbMath1137.62050MaRDI QIDQ3498633
Publication date: 16 May 2008
Full work available at URL: http://www3.stat.sinica.edu.tw/statistica/J18N1/J18N17/J18N17.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (42)
Asymptotically optimal maximin distance Latin hypercube designs ⋮ Bounding rare event probabilities in computer experiments ⋮ An efficient local search-based genetic algorithm for constructing optimal Latin hypercube design ⋮ LowCon: A Design-based Subsampling Approach in a Misspecified Linear Model ⋮ Topology optimization using material-field series expansion and Kriging-based algorithm: an effective non-gradient method ⋮ Bayesian inference using Gaussian process surrogates in cancer modeling ⋮ Reprint of: Bayesian inference using Gaussian process surrogates in cancer modeling ⋮ A new non-iterative deterministic algorithm for constructing asymptotically orthogonal maximin distance Latin hypercube designs ⋮ Doubly Coupled Designs for Computer Experiments With Both Qualitative and Quantitative Factors ⋮ Unnamed Item ⋮ On Sampling Methods for Costly Multi-Objective Black-Box Optimization ⋮ Exploratory ensemble designs for environmental models using k‐extended Latin Hypercubes ⋮ A new rotation method for constructing orthogonal Latin hypercube designs ⋮ On the maximin distance properties of orthogonal designs via the rotation ⋮ Construction of maximin \(L_1\)-distance Latin hypercube designs ⋮ Topology optimization design of deformable flexible thermoelectric devices for voltage enhancement ⋮ Some new classes of orthogonal Latin hypercube designs ⋮ Accurate emulators for large-scale computer experiments ⋮ On maximin distance and nearly orthogonal Latin hypercube designs ⋮ Latin hypercube sampling with multidimensional uniformity ⋮ Novel two-stage method for low-order polynomial model ⋮ Uniform projection designs ⋮ Column-orthogonal nearly strong orthogonal arrays ⋮ Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs ⋮ Orthogonal-column Latin hypercube designs with small samples ⋮ Designing a computer experiment that involves switches ⋮ Algorithms for generating maximin Latin hypercube and orthogonal designs ⋮ A new and flexible method for constructing designs for computer experiments ⋮ Construction of orthogonal Latin hypercube designs with flexible run sizes ⋮ A critical appraisal of design of experiments for uncertainty quantification ⋮ Two-dimensional minimax Latin hypercube designs ⋮ Maximin distance designs based on densest packings ⋮ Optimizing Latin hypercube designs by particle swarm ⋮ Optimal maximin \(L_2\)-distance Latin hypercube designs ⋮ On design and analysis of funnel testing experiments in webpage optimization ⋮ Global fitting of the response surface via estimating multiple contours of a simulator ⋮ Finding maximin Latin hypercube designs by iterated local search heuristics ⋮ Efficient space-filling and near-orthogonality sequential Latin hypercube for computer experiments ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Connecting U-type designs before and after level permutations and expansions ⋮ Maximum expected entropy transformed Latin hypercube designs ⋮ Representative points for distribution recovering
This page was built for publication:
