Search results
From MaRDI portal
- \(L_2\)-discrepancy of \(2^{s-k}\) designs and their complementary designs 2015-11-24 Paper A new strategy for optimal foldover two-level designs 2015-11-23 Paper Application...10 bytes (17 words) - 01:24, 10 December 2023
- differentially expressed genes from cDNA microarray experiments with complementary designs 2004-08-16 Paper...10 bytes (16 words) - 12:25, 24 September 2023
- Paper Application of minimum projection uniformity criterion in complementary designs 2011-02-05 Paper...10 bytes (16 words) - 04:00, 7 October 2023
- on combined designs 2016-04-07 Paper Some lower bounds of centered \(L_2\)-discrepancy of \(2^{s-k}\) designs and their complementary designs 2015-11-24...10 bytes (17 words) - 03:55, 10 December 2023
- differentially expressed genes from cDNA microarray experiments with complementary designs 2004-08-16 Paper https://portal.mardi4nfdi.de/entity/Q4532856 2002-10-29...10 bytes (18 words) - 12:25, 24 September 2023
- Construction of (K5∖e)-Designs of Orders 27, 135, 162, and 216 2013-08-13 Paper On minimal defining sets of full designs and self-complementary designs, and a new...10 bytes (16 words) - 10:41, 6 October 2023
- related criteria for mixed-level designs 2021-10-28 Paper New lower bounds to wrap-around \(L_2\)-discrepancy for U-type designs with three-level 2019-09-19...10 bytes (16 words) - 03:13, 25 September 2023
- differentially expressed genes from cDNA microarray experiments with complementary designs 2004-08-16 Paper Discovery of Conserved Sequence Patterns Using a...10 bytes (19 words) - 01:13, 9 December 2023
- aberration split-plot designs via complementary designs when the subplot factors are more important 2023-07-28 Paper Mixed-level designs with multi block variables...10 bytes (16 words) - 14:22, 6 October 2023
- 2023-09-04 Paper Constructing minimum aberration split-plot designs via complementary designs when the subplot factors are more important 2023-07-28 Paper...10 bytes (17 words) - 23:24, 9 December 2023
- minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs 2010-11-12 Paper https://portal...10 bytes (18 words) - 18:49, 6 October 2023
- factorial designs. 2006-07-18 Paper Construction of optimal multi-level supersaturated designs 2006-03-23 Paper One-factor-at-a-time designs of resolution...10 bytes (21 words) - 15:23, 9 December 2023
- array-based designs under a broad class of space-filling criteria 2022-12-08 Paper Using nonregular designs to generate space-filling designs 2022-07-20...10 bytes (16 words) - 11:29, 6 October 2023
- balanced designs 2019-11-07 Paper Resolvable group divisible designs with large groups 2016-12-06 Paper An Existence Theory for Incomplete Designs 2016-06-03...10 bytes (18 words) - 17:31, 11 December 2023
- family of $t$-regular self-complementary $k$-hypergraphs 2020-11-17 Paper Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs 2019-03-22...10 bytes (16 words) - 03:40, 10 December 2023
- family of $t$-regular self-complementary $k$-hypergraphs 2020-11-17 Paper Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs 2019-03-22...10 bytes (16 words) - 03:39, 10 December 2023
- hypercube designs 2015-02-19 Paper Efficient three-level screening designs using weighing matrices 2014-12-22 Paper U-type and column-orthogonal designs for...10 bytes (19 words) - 22:10, 8 December 2023
- classifying orthogonal designs 2023-06-19 Paper An adjusted gray map technique for constructing large four-level uniform designs 2023-04-26 Paper A new...10 bytes (19 words) - 19:57, 8 December 2023
- parameter designs 2006-08-14 Paper Detailed wordlength pattern of regular fractional factorial split-plot designs in terms of complementary sets 2006-08-04...10 bytes (18 words) - 14:17, 28 January 2024
- lower bounds of centered \(L_2\)-discrepancy of \(2^{s-k}\) designs and their complementary designs 2015-11-24 Paper An extension of the Golden-Thompson theorem...10 bytes (16 words) - 08:08, 7 October 2023
