Results 31 to 40 of about 170,610 (66)

Time and Space Complexity of Deterministic and Nondeterministic Decision Trees: Local Approach

BigData Congress [Services Society], 2023
Extensive research has been conducted on rough set theory, specifically focusing on the study of decision trees (DTs) and decision rule systems (DRSs).
Kerven Durdymyradov, Mikhail Moshkov
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Lifting to Parity Decision Trees Via Stifling

Information Technology Convergence and Services, 2022
We 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, Nikhil S. Mande, Swagato Sanyal, Suhail Sherif   +3 more
semanticscholar   +1 more source

Deterministic and Nondeterministic Decision Trees for Rough Computing

Fundamenta Informaticae, 2000
Mikhail Moshkov
openalex   +2 more sources

Entrenching Decision Trees in a Robust Molecular Circuit Element

International Symposium on Circuits and Systems, 2022
By mapping logic complexities onto molecular redox transitions, we embed decision trees in a nanoscale memristive element. Our circuit element is robust, and the switching events are deterministic.
T. Venkatesan, S. Goswami, R. S. Williams, Sreetosh Goswami   +3 more
semanticscholar   +1 more source

Deterministic and Nondeterministic Decision Trees for Recognition of Properties of Decision Rule Systems

IJCRS
Kerven Durdymyradov, Mikhail Moshkov
openalex   +2 more sources

One-way communication complexity and non-adaptive decision trees

Electron. Colloquium Comput. Complex., 2021
We 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

Greedy Algorithm for Construction of Deterministic Decision Trees for Conventional Decision Tables from Closed Classes

IJCRS
Azimkhon Ostonov, Mikhail Moshkov
openalex   +2 more sources

Deterministic and Nondeterministic Decision Trees for Recognition of All Realizable Decision Rules

Asian Conference on Intelligent Information and Database Systems
Kerven Durdymyradov, Mikhail Moshkov
openalex   +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, 2012
Michael L. Valenzuela, Liana Suantak, Jerzy W. Rozenblit   +2 more
openalex   +2 more sources

Efficient Decision Trees for Tensor Regressions

arXiv.org
We proposed the tensor-input tree (TT) method for scalar-on-tensor and tensor-on-tensor regression problems. We first address scalar-on-tensor problem by proposing scalar-output regression tree models whose input variable are tensors (i.e., multi-way ...
Hengrui Luo, Akira Horiguchi, Li Ma
semanticscholar   +1 more source