The following pages link to Mikhail Ju. Moshkov (Q933598):
Displayed 50 items.
- (Q266839) (redirect page) (← links)
- Decision trees with minimum average depth for sorting eight elements (Q266840) (← links)
- Diagnosis of three types of constant faults in read-once contact networks over finite bases (Q278720) (← links)
- Totally optimal decision trees for Boolean functions (Q323025) (← links)
- Combinatorial machine learning. A rough set approach. (Q545918) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- Partial covers, reducts and decision rules in rough sets. Theory and applications (Q933600) (← links)
- Inhibitory rules in data analysis. A rough set approach (Q938640) (← links)
- Maximal consistent extensions of information systems relative to their theories (Q1031680) (← links)
- Totally optimal decision rules (Q1693173) (← links)
- Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions (Q1694833) (← links)
- Bi-criteria optimization problems for decision rules (Q1730539) (← links)
- Bi-criteria optimization of decision trees with applications to data analysis (Q1754136) (← links)
- Greedy algorithm for the construction of approximate decision rules for decision tables with many-valued decisions (Q1989508) (← links)
- Element partition trees for \(h\)-refined meshes to optimize direct solver performance. I: Dynamic programming (Q2011908) (← links)
- Decision trees based on 1-consequences (Q2043377) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- Rough analysis of computation trees (Q2172394) (← links)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- Dynamic programming multi-objective combinatorial optimization (Q2218697) (← links)
- Diagnosis of constant faults in read-once contact networks over finite bases (Q2341754) (← links)
- On algorithms for construction of all irreducible partial covers (Q2379946) (← links)
- WQO is decidable for factorial languages (Q2407108) (← links)
- Three approaches to data analysis. Test theory, rough sets and logical analysis of data. (Q2429140) (← links)
- On the class of restricted linear information systems (Q2461209) (← links)
- Dynamic programming approach to optimization of approximate decision rules (Q2510537) (← links)
- Diagnosis of constant faults in iteration-free circuits over monotone basis (Q2636825) (← links)
- Minimizing depth of decision trees with hypotheses (Q2670891) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
- (Q2843957) (← links)
- Classifiers Based on Optimal Decision Rules (Q2865085) (← links)
- Three Approaches to Deal with Tests for Inconsistent Decision Tables – Comparative Study (Q2947187) (← links)
- (Q3005908) (← links)
- Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions (Q3075513) (← links)
- Dynamic Programming Approach for Partial Decision Rule Optimization (Q3168190) (← links)
- Greedy Algorithms withWeights for Construction of Partial Association Rules (Q3397159) (← links)
- Irreducible Descriptive Sets of Attributes for Information Systems (Q3401129) (← links)
- (Q3425586) (← links)
- (Q3504347) (← links)
- On Testing Membership to Maximal Consistent Extensions of Information Systems (Q3535438) (← links)
- On Irreducible Descriptive Sets of Attributes for Information Systems (Q3541042) (← links)
- Comparison of Some Classification Algorithms Based on Deterministic and Nondeterministic Decision Rules (Q3587285) (← links)
- On Partial Covers, Reducts and Decision Rules with Weights (Q3591004) (← links)
- On Partial Covers, Reducts and Decision Rules (Q3600307) (← links)
- (Q3638001) (← links)
- (Q4250250) (← links)
- (Q4318642) (← links)
- (Q4327609) (← links)
- (Q4340307) (← links)
- (Q4372942) (← links)