Results 281 to 290 of about 10,339,939 (316)

D-optimal weighing designs for six objects

Metrika, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Neubauer, Michael G., Watkins, William, Zeitlin, Joel   +2 more
openaire   +2 more sources

Soft selection in D-optimal designs

1994
A new algorithm generating the D-optimal experimental designs, based on an evolutionary search with soft selection, is presented. An efficiency of the numerical algorithm is compared with classical exchange algorithms. Preliminary results are promising and encourage more detailed investigations.
openaire   +1 more source

Some new D-optimal designs [PDF]

Australas. J Comb., 1997
Summary: We construct several new \((v;r,s; \lambda)\) supplementary difference sets with \(v\) odd and \(r+s= \lambda+ (v-1)/2\). They give rise to \(D\)-optimal designs of order \(2v\). \(D\)-optimal designs of orders 158, 194, and 290 are constructed here for the first time. We also give an up to date survey of this class of supplementary difference
openaire   +1 more source

On \(d\)-optimality of the LR tests

Kybernetika, 1995
Summary: The lower asymptotic distributional bound of the level attained is attained in the case of the likelihood ratio statistics. The regularity conditions on which the proofs are based are verified for the non-singular normal, the multinomial and the Poisson distribution.
openaire   +2 more sources

D-optimal design for Becker's minimum polynomial

Statistics & Probability Letters, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

D-optimal designs on the unit q-ball

Journal of Statistical Planning and Inference, 1988
Abstract Consider a polynomial regression model on the unit q-ball. We can express the determinant of the information matrix in terms of canonical moments. Thus we can find the robust-type D-optimal designs in the sense of Stigler (1971) and Studden (1982).
openaire   +1 more source

Iterative R-D optimization of H.264

2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. The primal decomposition method enables spatial or temporal prediction dependency within a group of picture (GOP) to be processed in the master primal problem.
Cheolhong An, Truong Q. Nguyen
openaire   +1 more source

D-Optimal Designs for a Multivariate Polynomial Model

Vestnik St. Petersburg University, Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. V. Shpilev, E. S. Kucha
openaire   +2 more sources

D-optimal designs for weighted polynomial regression

Statistics & Probability Letters, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

D-optimal and near D-optimal fractional factorial designs of resolution V

Journal of Statistical Planning and Inference, 2009
Dursun A. Bulutoglu, Kenneth J. Ryan
openaire   +1 more source