The following pages link to Transactions on Rough Sets III (Q5465691):
Displaying 16 items.
- 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)
- On the relation between rough set reducts and typical testors (Q526674) (← links)
- Average time complexity of decision trees. (Q639456) (← links)
- Rudiments of rough sets (Q867594) (← links)
- On graphs of the cone decompositions for the min-cut and max-cut problems (Q1751487) (← links)
- Bi-criteria optimization of decision trees with applications to data analysis (Q1754136) (← 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)
- Diagnosis of constant faults in read-once contact networks over finite bases (Q2341754) (← links)
- On the class of restricted linear information systems (Q2461209) (← links)
- Diagnosis of constant faults in iteration-free circuits over monotone basis (Q2636825) (← links)
- Time and space complexity of deterministic and nondeterministic decision trees (Q2679423) (← links)
- (Q4939662) (← links)
