Committees of systems of linear inequalities
From MaRDI portal
Recommendations
Cited in
(19)- The theory of committee decisions and the double median method
- scientific article; zbMATH DE number 4024655 (Why is no real title available?)
- Committee constructions.
- scientific article; zbMATH DE number 2047437 (Why is no real title available?)
- A graph-theoretic algorithm for constructing a committee of an inconsistent system of linear inequalities
- Two-dimensional representation of three-dimensional systems of homogeneous linear inequalities
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
- Committee polyhedral separability: complexity and polynomial approximation
- On the number of solutions to a system of Boolean equations
- scientific article; zbMATH DE number 2205648 (Why is no real title available?)
- Dichotomy algorithms in the multi-class problem of pattern recognition
- On the computational complexity of the minimum committee problem
- On the number of solutions to linear Diophantine equation and Frobenius problem
- Estimate of the number of members in the minimal committee of a system of linear inequalities
- Constraint elimination method for the committee problem
- scientific article; zbMATH DE number 3847212 (Why is no real title available?)
- Parallel computations and committee constructions
- An algorithm to find the smallest committee containing a given set
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
This page was built for publication: Committees of systems of linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1778972)
