scientific article
From MaRDI portal
Publication:3928080
zbMath0473.62067MaRDI QIDQ3928080
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (78)
Level-augmented uniform designs ⋮ A catalog of optimal foldover plans for constructing U-uniform minimum aberration four-level combined designs ⋮ Construction of Uniform Designs and Complex-Structured Uniform Designs via Partitionable t-Designss ⋮ Discrete particle swarm optimization for constructing uniform design on irregular regions ⋮ Compromise design for combination experiment of two drugs ⋮ A new class of two-level optimal extended designs ⋮ Two-level screening designs derived from binary nonlinear codes ⋮ Novel techniques for performing successful follow-up experiments based on prior information from initial-stage experiments ⋮ Building some bridges among various experimental designs ⋮ A new strategy for tripling ⋮ Choice of optimal second stage designs in two-stage experiments ⋮ Construction of uniform mixed-level designs through level permutations ⋮ An effective approach for the optimum addition of runs to three-level uniform designs ⋮ MOEA/D + uniform design: a new version of MOEA/D for optimization problems with many objectives ⋮ Detecting non-isomorphic orthogonal design ⋮ Improving the space-filling behavior of multiple triple designs ⋮ Hybrid harmony search and artificial bee colony algorithm for global optimization problems ⋮ Some interesting behaviors of good lattice point sets ⋮ Algorithmic construction of nearly column-orthogonal designs ⋮ Cross-entropy loss for recommending efficient fold-over technique ⋮ Construction of uniform designs via an adjusted threshold accepting algorithm ⋮ An efficient modified Hyperband and trust-region-based mode-pursuing sampling hybrid method for hyperparameter optimization ⋮ A novel algorithm for generating minimum energy points from identically charged particles in 1D, 2D and 3D unit hypercubes ⋮ Construction of column-orthogonal designs for computer experiments ⋮ Optimum addition of information to computer experiments in view of uniformity and orthogonality ⋮ A novel technique for constructing nonregular nine-level designs: adjusted multiple tripling technique ⋮ Design efficiency for minimum projection uniform designs with \(q\) levels ⋮ Sequentially weighted uniform designs ⋮ Optimal U-type design for Bayesian nonparametric multiresponse prediction ⋮ An adjusted gray map technique for constructing large four-level uniform designs ⋮ New lower bound for Lee discrepancy of asymmetrical factorials ⋮ Generation of space-filling uniform designs in unit hypercubes ⋮ Constructions of uniform designs by using resolvable packings and coverings. ⋮ A new variable selection method for uniform designs ⋮ A note on construction of nearly uniform designs with large number of runs. ⋮ Uniform design over general input domains with applications to target region estimation in computer experiments ⋮ Optimized \(U\)-type designs on flexible regions ⋮ An appealing technique for designing optimal large experiments with three-level factors ⋮ Asymmetric uniform designs based on mixture discrepancy ⋮ Admissibility and minimaxity of the uniform design measure in nonparametric regression model ⋮ Dynamic simulation metamodeling using Mars: a case of radar simulation ⋮ Designing uniform computer sequential experiments with mixture levels using Lee discrepancy ⋮ A stochastic representation for the lp-norm symmetric distribution and its applications ⋮ The depth-design: an efficient generation of high dimensional computer experiments ⋮ New results on quaternary codes and their Gray map images for constructing uniform designs ⋮ A study of uniformity pattern for extended designs ⋮ Support points ⋮ Lower bounds of various criteria in experimental designs ⋮ Construction of uniform designs without replications ⋮ Mixed-level column augmented uniform designs ⋮ Design of computer experiments: space filling and beyond ⋮ An efficient method for constructing uniform designs with large size ⋮ A modification to MOEA/D-DE for multiobjective optimization problems with complicated Pareto sets ⋮ A weighted sequential sampling method considering influences of sample qualities in input and output parameter spaces for global optimization ⋮ Resolvable packings \(\widetilde{\text{R}}\text{MP}(3,2;n,n-3)\) and coverings \(\widetilde{\text{R}}\text{MC}(3,2;n,n-2)\) ⋮ Nearly uniform design construction on flexible region ⋮ Augmented uniform designs ⋮ Constructing optimal projection designs ⋮ Issues in the optimal design of computer simulation experiments ⋮ A stochastic dynamic model of train-track-bridge coupled system based on probability density evolution method ⋮ Construction of four-level and mixed-level designs with zero Lee discrepancy ⋮ Optimal Noncollapsing Space-Filling Designs for Irregular Experimental Regions ⋮ Multiple doubling: a simple effective construction technique for optimal two-level experimental designs ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Connecting U-type designs before and after level permutations and expansions ⋮ Constructing optimal four-level designs via Gray map code ⋮ Sharp lower bounds of various uniformity criteria for constructing uniform designs ⋮ New lower bounds of four-level and two-level designs via two transformations ⋮ A systematic construction approach for nonregular fractional factorial four-level designs via quaternary linear codes ⋮ A novel non-heuristic search technique for constructing uniform designs with a mixture of two- and four-level factors: a simple industrial applicable approach ⋮ Numerical computation of triangular complex spherical designs with small mesh ratio ⋮ \(D\)-optimal design for a causal structure for completely randomized and random blocked experiments ⋮ Lower bounds for wrap-around \(L_2\)-discrepancy and constructions of symmetrical uniform designs ⋮ Designing optimal large four-level experiments: a new technique without recourse to optimization softwares ⋮ Weighted symmetrized centered discrepancy for uniform design ⋮ Representative points for distribution recovering ⋮ Construction of multi-level space-filling designs via code mappings ⋮ Model-robust designs in multiresponse situations.
This page was built for publication:
