Results 1 to 10 of about 86,722 (264)
Entropy, 2023 In this paper, we consider classes of conventional decision tables closed relative to the removal of attributes (columns) and changing decisions assigned to rows.
Azimkhon Ostonov, Mikhail Moshkov
doaj +6 more sources
EntropyIn this paper, we consider classes of decision tables with many-valued decisions closed under operations of the removal of columns, the changing of decisions, the permutation of columns, and the duplication of columns.
Azimkhon Ostonov, Mikhail Moshkov
doaj +7 more sources
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the synthesis of deterministic tree transducers from automaton definable specifications, given as binary relations, over finite trees.
Christof Löding, Sarah Winter
doaj +11 more sources
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity [PDF]
Information Processing Letters, 2010 A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all ...
Ambainis +9 more
core +4 more sources
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs [PDF]
, 2019 This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs, deterministic or non-deterministic.
Buss, Sam, Das, Anupam, Knop, Alexander
core +8 more sources
Credible capacity evaluation of virtual power plants considering wind and PV uncertainties [PDF]
Scientific ReportsThe increasing integration of weather-dependent renewable energy sources into Virtual Power Plants (VPPs) introduces significant uncertainty in short-term dispatch planning.
Chaojie Li +7 more
doaj +2 more sources
AxiomsIn this paper, an efficient algorithm for modeling the operation of a DDT (Deterministic Decision Tree) solving the problem of realizability of DRs (Decision Rules) is proposed and analyzed.
Kerven Durdymyradov, Mikhail Moshkov
doaj +2 more sources
An Explainable Bayesian Decision Tree Algorithm
Frontiers in Applied Mathematics and Statistics, 2021 Bayesian Decision Trees provide a probabilistic framework that reduces the instability of Decision Trees while maintaining their explainability. While Markov Chain Monte Carlo methods are typically used to construct Bayesian Decision Trees, here we ...
Giuseppe Nuti +2 more
doaj +1 more source
Exploring the PV Power Forecasting at Building Façades Using Gradient Boosting Methods
Energies, 2023 Solar power forecasting is of high interest in managing any power system based on solar energy. In the case of photovoltaic (PV) systems, and building integrated PV (BIPV) in particular, it may help to better operate the power grid and to manage the ...
Jesús Polo +5 more
doaj +1 more source
IEEE Access, 2023 This paper investigates classes of decision tables (DTs) with 0-1-decisions that are closed under the removal of attributes (columns) and changes to the assigned decisions to rows. For tables from any closed class (CC), the authors examine how the minimum complexity of deterministic decision trees (DDTs) depends on the minimum complexity of a strongly ...
Azimkhon Ostonov, Mikhail Moshkov
openaire +2 more sources