scientific article; zbMATH DE number 3106671

From MaRDI portal
Publication:5845479

zbMath0063.06425MaRDI QIDQ5845479

C. Radhakrishna Rao

Publication date: 1946


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (33)

Combinatorial techniques for universal hashingFURTHER CONSTRUCTION OF BALANCED ARRAYSA new mathematical space with applications to statistical experimental design. I: Preliminary resultsMixture designs constructed using Taguchi's mixed element orthogonal arraysOrthogonal and partially balanced arrays and their application in design of experimentsA study of frequency cubesNeural network and regression spline value function approximations for stochastic dynamic programmingOrthogonal F-rectangles, orthogonal arrays, and codesOn orthogonal arrays attaining Rao's boundsA brief biography and appreciation of Calyampudi Radhakrishna Rao, with a bibliography of his books and papersOn nonorthogonality and nonoptimality of Addelman's main-effect plans satisfying the condition of proportional frequenciesOrthogonal arrays and designs for partial triallel crossesCombinatorial methods in the construction of point sets with uniformity propertiesUnnamed ItemSymmetric Layer-Rainbow Colorations of CubesSharp bounds on the price of bandit feedback for several models of mistake-bounded online learningReplication procedure for grouped Sobol' indices estimation in dependent uncertainty spacesConstruction of systematic row-column designs with treatments unconfounded with the linear row \(\times\) columns and quadratic row \(\times\) columns interactionsSmall matrices of large dimension3-Uniform states and orthogonal arrays of strength 3Aspects of optimality of plans orthogonal through other factors and related multiway designsOrthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubesClassification of Graeco-Latin CubesTheory of factorial designs of the parallel flats type. I: The coefficient matrixOn the construction of balanced and orthogonal arraysA note on the price of bandit feedback for mistake-bounded online learningNearest neighbor balanced block designs for autoregressive errorsNew bounds on the price of bandit feedback for mistake-bounded online multiclass learningFactorials experiments, covering arrays, and combinatorial testingAliasing in \(2^{n-k}\) fractions in the case of a separation of factorsOn finding mixed orthogonal arrays of strength 2 with many 2-level factorsBalanced E-optimal designs of resolution III for the \(2^ m\times 3^ n\) seriesA Scientific Tour on Orthogonal Arrays




This page was built for publication: