Algebraic closures of a generalized model of estimation algorithms
From MaRDI portal
Recommendations
- Algebraic closures of a generalized model of estimation algorithms
- Theory of equivalence systems for describing the algebraic closures of a generalized estimation model
- Correct algebras over estimation algorithms in the set of regular recognition problems with nonoverlapping classes
- The construction of a recognition algorithm in the algebraic closure.
- An algebra over estimation algorithms: the minimal power of the correct algorithm
Cited in
(11)- Completeness criteria for a linear model of classification algorithms with respect to families of decision rules
- Theory of equivalence systems for the description of algebraic closures in a generalized estimation model. II
- Correct algebras over estimation algorithms in the set of regular recognition problems with nonoverlapping classes
- An algebra over estimation algorithms: normalization with respect to the interval
- Theory of equivalence systems for describing the algebraic closures of a generalized estimation model
- The algebraic closure of a family of separated algorithms
- The correctness of algebraic closures of finite degree of a family of estimate-computing algorithms for regular problems
- An algebra over estimation algorithms: the minimal power of the correct algorithm
- Algebraic closures of a generalized model of estimation algorithms
- On the correctness of linear closure in a class of estimation algorithms
- Correctness criteria for algebraic closures of the estimate-calculating algorithm model
This page was built for publication: Algebraic closures of a generalized model of estimation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892537)
