The following pages link to (Q3992464):
Displayed 11 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)
- 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)