scientific article; zbMATH DE number 3550719
From MaRDI portal
Publication:4124844
zbMath0354.05015MaRDI QIDQ4124844
No author found.
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (40)
MBMUDs: A combinatorial extension of BIBDs showing good optimality behaviour ⋮ Balanced semi-Latin rectangles: properties, existence and constructions for block size two ⋮ Uniform semi-Latin squares and their pairwise-variance aberrations ⋮ On the efficiency of regular generalized line graph designs ⋮ On the E-optimality of certain asymmetrical designs under mixed effects model ⋮ \(D\)-optimality of the dual of BIB designs ⋮ A comparison of super-valid restricted and row-column randomization ⋮ Nonexistence of a regular graph design with \(v=17\) and \(k=6\) ⋮ Designs on the web ⋮ Constructions for regular-graph semi-Latin rectangles with block size two ⋮ Regular graph designs ⋮ A family of resolvable regular graph designs ⋮ A unified theory for generalized cyclic designs ⋮ Optimal regular graph designs ⋮ A note on robustness of D-optimal block designs for two-colour microarray experiments ⋮ D-optimal block designs with at most six varieties ⋮ Relationships of optimality for individual factors of a design ⋮ On the comparison of PBIB designs with two associate classes ⋮ An efficient semi-Latin square for twelve treatments in blocks of size two ⋮ Construction of (M,S)-optimal design for block size 3 ⋮ Experiments in rectangular areas: design and randomization ⋮ New 3-level response surface designs constructed from incomplete block designs ⋮ An algorithm for optimization of block designs ⋮ Symmetric factorial designs in blocks ⋮ The completely symmetric designs with blocksize three ⋮ On the optimality of a class of designs with three concurrences ⋮ A genetic algorithm for designing microarray experiments ⋮ Some sufficient conditions for type 1 optimality with applications to regular graph designs ⋮ Variance and concurrence in block designs, and distance in the corresponding graphs ⋮ Optimal incomplete-block designs with low replication: a unified approach using graphs ⋮ Maximal determinant over a certain class of matrices and its application to D-optimality of designs ⋮ A note on the E-optimality of regular line graph designs ⋮ Constructing definitive screening designs using cyclic generators ⋮ A catalog of orthogonally blocked three-level second-order designs with run sizes \(\leq 100\) ⋮ Substitutes for the non-existent square lattice designs for 36 varieties ⋮ Some sufficient conditions for the type 1 optimality of block designs ⋮ Some optimal designs of block size two ⋮ On symmetric spatial configurations ⋮ On the optimality of block designs ⋮ Optimality and construction of some rectangular designs
This page was built for publication:
