Pages that link to "Item:Q1984679"

The following pages link to On greedy heuristics for computing D-efficient saturated subsets (Q1984679):

Displaying 3 items.

• 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)