Pages that link to "Item:Q1984679"
From MaRDI portal
The following pages link to On greedy heuristics for computing D-efficient saturated subsets (Q1984679):
Displaying 8 items.
- On the greedy algorithm for satisfiability (Q1198012) (← links)
- Optimal design of multifactor experiments via grid exploration (Q2058892) (← links)
- Circuits for robust designs (Q2093130) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
- On greedy heuristics for computing D-efficient saturated subsets (Q6318973) (← links)
- A review on design inspired subsampling for big data (Q6549149) (← links)
- ForLion: a new algorithm for D-optimal designs under general parametric statistical models with mixed factors (Q6606955) (← links)