The following pages link to Radoslav Harman (Q254192):
Displaying 33 items.
- Privacy sets for constrained space-filling (Q254194) (← links)
- (Q393588) (redirect page) (← links)
- Multiplicative methods for computing \(D\)-optimal stratified designs of experiments (Q393589) (← links)
- (Q513973) (redirect page) (← links)
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments (Q513974) (← links)
- Optimality of equidistant sampling designs for the Brownian motion with a quadratic drift (Q538129) (← links)
- On decompositional algorithms for uniform sampling from \(n\)-spheres and \(n\)-balls (Q604345) (← links)
- Optimal prediction designs in finite discrete spectrum linear regression models (Q604646) (← links)
- A conditional distribution approach to uniform sampling on spheres and balls in \(L_{p}\) spaces (Q715501) (← links)
- Ascent with quadratic assistance for the construction of exact experimental designs (Q782649) (← links)
- Minimal efficiency of designs under the class of orthogonally invariant information criteria (Q814850) (← links)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms (Q870328) (← links)
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming (Q888509) (← links)
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming (Q961110) (← links)
- Computing efficient exact designs of experiments using integer quadratic programming (Q1621402) (← links)
- Computing optimal experimental designs with respect to a compound Bayes risk criterion (Q1640941) (← links)
- Removal of the points that do not support an \(E\)-optimal experimental design (Q1726897) (← links)
- Computing maximin efficient experimental designs using the methods of semidefinite programming (Q1936672) (← links)
- On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
- Optimal design of multifactor experiments via grid exploration (Q2058892) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- Optimal approximate designs for estimating treatment contrasts resistant to nuisance effects (Q2374437) (← links)
- Optimal approximate designs for comparison with control in dose-escalation studies (Q2404169) (← links)
- Approximate \(E\)-optimal designs for the model of spring balance weighing with a constant bias (Q2431589) (← links)
- Equivalence theorem for Schur optimality of experimental designs (Q2474399) (← links)
- Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend (Q2833362) (← links)
- Optimal Designs for Steady-State Kalman Filters (Q2833369) (← links)
- Criterion-Robust Experimental Designs for the Quadratic Regression on a Square and a Cube (Q2839067) (← links)
- Criterion-robust designs for the models of spring balance weighing (Q2913235) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- Construction of efficient experimental designs under multiple resource constraints (Q4628716) (← links)
- A design criterion for symmetric model discrimination based on flexible nominal sets (Q5120965) (← links)
- Iterated partial summations applied to finite-support discrete distributions (Q5142377) (← links)
