Results 241 to 250 of about 286,084 (291)
Some of the next articles are maybe not open access.
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.
M. Moshkov
semanticscholar +3 more sources
, 2020
In this chapter, upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called additive-bounded uncertainty measures for decision tables.
M. Moshkov
semanticscholar +2 more sources
In this chapter, upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called additive-bounded uncertainty measures for decision tables.
M. Moshkov
semanticscholar +2 more sources
Decision Support Using Deterministic Equivalents of Probabilistic Game Trees
2012 IEEE 19th International Conference and Workshops on Engineering of Computer-Based Systems, 2012We have developed a game-theory driven decision-support tool that builds probabilistic game trees automatically from user-defined actions, rules, and states. The result of evaluating the paths in the game tree is a series of decisions which forms a decision-path representing an epsilon-Nash-Equilibrium.
Michael L. Valenzuela +2 more
semanticscholar +2 more sources
, 2020
In this chapter, for complexity functions having the properties \(\varLambda 1 \), \(\varLambda 2\), and \(\varLambda 3\), upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called difference-bounded uncertainty
M. Moshkov
semanticscholar +2 more sources
In this chapter, for complexity functions having the properties \(\varLambda 1 \), \(\varLambda 2\), and \(\varLambda 3\), upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called difference-bounded uncertainty
M. Moshkov
semanticscholar +2 more sources
Deterministic and Nondeterministic Decision Trees for Recognition of All Realizable Decision Rules
Asian Conference on Intelligent Information and Database SystemsKerven Durdymyradov, M. Moshkov
semanticscholar +2 more sources
Lifting to Parity Decision Trees Via Stifling
Information Technology Convergence and Services, 2022We show that the deterministic decision tree complexity of a (partial) function or relation $f$ lifts to the deterministic parity decision tree (PDT) size complexity of the composed function/relation $f \circ g$ as long as the gadget $g$ satisfies a ...
A. Chattopadhyay +3 more
semanticscholar +1 more source
One-way communication complexity and non-adaptive decision trees
Electron. Colloquium Comput. Complex., 2021We study the relationship between various one-way communication complexity measures of a composed function with the analogous decision tree complexity of the outer function.
Nikhil S. Mande, Swagato Sanyal
semanticscholar +1 more source
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