Pages that link to "Item:Q3992464"
From MaRDI portal
The following pages link to The committee method for optimization and classification problems. (Q3992464):
Displaying 14 items.
- On the problem polyhedral separability: a numerical solution (Q268664) (← links)
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms (Q463372) (← links)
- Parallel algorithm for solving linear programming problem under conditions of incomplete data (Q612150) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Solving of optimization and identification problems by the committee methods (Q1097612) (← links)
- An algorithm for the committee construction problem (Q1333475) (← links)
- Some principles of coordinated decision making in distributed systems (Q1364095) (← links)
- Committee-based inductive inference (Q1816345) (← links)
- Constraint elimination method for the committee problem (Q2261721) (← links)
- Penalty function method and regularization in the analysis of improper convex programs (Q2284209) (← links)
- Parallel computations and committee constructions (Q2458086) (← links)
- Relative blocking in posets (Q2467569) (← links)
- Dichotomy Algorithms in the Multi-class Problem of Pattern Recognition (Q5110854) (← links)
- (Q5754127) (← links)
