Results 111 to 120 of about 3,608,849 (131)
Deterministic and Nondeterministic Decision Trees for Recognition of All Realizable Decision Rules
Lecture Notes in Computer ScienceThe exploration of the relationships between decision trees and systems of decision rules is a significant research domain within computer science. While established methods exist for converting decision trees into systems of decision rules, the reverse ...
Mikhail Moshkov, Kerven Durdymyradov
exaly +4 more sources
Deterministic and Nondeterministic Decision Trees for Decision Rule Systems from Closed Classes
Lecture Notes in Computer ScienceThe study of the relationships between decision rule systems and decision trees is of considerable interest in computer science. In this paper, we consider classes of decision rule systems that are closed under the operation of attribute removal.
Mikhail Moshkov, Kerven Durdymyradov
exaly +3 more sources
Time and space complexity of deterministic and nondeterministic decision trees
Annals of Mathematics and Artificial Intelligence, 2022 AbstractIn this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a problem over information system, which is described by a finite number of attributes and a mapping ...
Mikhail Moshkov
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Intelligent Systems Reference Library, 2020
In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions.
Mikhail Moshkov
exaly +2 more sources
In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions.
Mikhail Moshkov
exaly +2 more sources
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Journal of the ACM, 1985This work generalizes decision trees in order to study lower bounds on the running times of algorithms that allow probabilistic, nondeterministic, or alternating control. It is shown that decision trees that are allowed internal randomization (at the expense of introducing a small probability of error) run no faster asymptotically than ordinary ...
Martin Paul Tompa
exaly +4 more sources
Probabilistic, Nondeterministic, and Alternating Decision Trees
Proceedings of the fourteenth annual ACM symposium on Theory of computing, 1982This work generalizes decision trees in order to model algorithms which allow probabilistic, nondeterministic, or alternating control. Two geometric techniques for proving lower bounds on the time required by ordinary decision trees (Dobkin and Lipton's -&-ldquo;region-counting-&-rdquo; technique as applied to the knapsack and element uniqueness ...
Udi Manber, Martin Tompa
openaire +2 more sources
Deterministic and Nondeterministic Decision Trees for Rough Computing
Fundamenta Informaticae, 2000In the paper, infinite information systems are considered which are used in pattern recognition, discrete optimization, computational geometry. Depth and size of deterministic and nondeterministic decision trees over such information systems are studied. Two classes of infinite information systems are investigated.
openaire +3 more sources
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees. Global Approach
Studies in Big DataAzimkhon Ostonov +2 more
exaly +2 more sources
COMPARITIVE ANALYSIS OF DETERMINISTIC AND NONDETERMINISTIC DECISION TREE COMPLEXITY. GLOBAL APPROACH
Fundamenta Informaticae, 1996We study the relationships between the complexity of a task description and the minimal complexity of deterministic and nondeterministic decision trees solving this task. We investigate decision trees assuming a global approach i.e. arbitrary checks from a given check system can be used for constructing decision trees.
openaire +2 more sources
Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity. Global Approach
Studies in Big DataAzimkhon Ostonov +2 more
exaly +2 more sources