Pages that link to "Item:Q1005473"
From MaRDI portal
The following pages link to Computational complexity of the minimum committee problem and related problems (Q1005473):
Displayed 4 items.
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms (Q463372) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)
- Parallel computations and committee constructions (Q2458086) (← links)