The following pages link to B. M. Litvakov (Q599537):
Displaying 19 items.
- Iterative procedures for finding agglomerations of subsets (Q599538) (← links)
- Decomposition of choice functions into a system of simpler functions (Q755406) (← links)
- Approximation of choice function (Q802459) (← links)
- Structure of the set of generating graphs in the theory of pseudocriteria (Q910313) (← links)
- Pseudocriterion choice of alternatives (Q922919) (← links)
- Approximation of choice functions with a constrained set of presentations (Q1085017) (← links)
- Tournament methods in choice theory (Q1085019) (← links)
- Extensions of the theory of choosing variants (Foundations of the theory of pseudocriteria) (Q1116867) (← links)
- Pseudocriteria and pseudocriterial choice (Q1119143) (← links)
- Choice using set-graph structures (Q1151812) (← links)
- On decomposition of choice functions in a system of interval choices (Q1165124) (← links)
- Study of large numerical data files with missing data (Q1222954) (← links)
- On a class of Robbins-Monro procedures (Q1233284) (← links)
- Stratified sampling in the organization of empirical data collection (Q1239979) (← links)
- Pseudographs and their use for choice (Q1333735) (← links)
- Choice by vectorial pseudocriteria (Q1338847) (← links)
- Convergence of recurrent algorithms for pattern recognition learning (Q2527886) (← links)
- An iteration method in the problem of approximating functions from a finite number of observations (Q2546453) (← links)
- The approximating properties of certain algorithms of the potential functions method (Q2559901) (← links)
