Pages that link to "Item:Q1778972"
From MaRDI portal
The following pages link to Committees of systems of linear inequalities (Q1778972):
Displaying 13 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)
- On the computational complexity of the minimum committee problem (Q928677) (← links)
- An algorithm to find the smallest committee containing a given set (Q1080373) (← links)
- The theory of committee decisions and the double median method (Q1097820) (← links)
- Estimate of the number of members in the minimal committee of a system of linear inequalities (Q1569404) (← links)
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)
- On the number of solutions to a system of Boolean equations (Q2052605) (← links)
- On the number of solutions to linear Diophantine equation and Frobenius problem (Q2088674) (← links)
- Two-dimensional representation of three-dimensional systems of homogeneous linear inequalities (Q2487728) (← links)
- Committee constructions. (Q2736216) (← links)
- A graph-theoretic algorithm for constructing a committee of an inconsistent system of linear inequalities (Q3785828) (← links)
- Dichotomy Algorithms in the Multi-class Problem of Pattern Recognition (Q5110854) (← links)
