Results 11 to 20 of about 86,158 (257)

A Local Approach to Studying the Time and Space Complexity of Deterministic and Nondeterministic Decision Trees [PDF]

open access: green, 2023
In 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 associating a ...
Kerven Durdymyradov, Mikhail Moshkov
openalex   +3 more sources

Comparison of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-valued Decisions from Closed Classes [PDF]

open access: green, 2023
arXiv admin note: substantial text overlap with arXiv:2305.06093, arXiv:2304 ...
Azimkhon Ostonov, Mikhail Moshkov
openalex   +3 more sources

Review of Kalah Game Research and the Proposition of a Novel Heuristic–Deterministic Algorithm Compared to Tree-Search Solutions and Human Decision-Making [PDF]

open access: goldInformatics, 2020
The Kalah game represents the most popular version of probably the oldest board game ever—the Mancala game. From this viewpoint, the art of playing Kalah can contribute to cultural heritage. This paper primarily focuses on a review of Kalah history and on a survey of research made so far for solving and analyzing the Kalah game (and some other related ...
Libor Pekař   +3 more
openalex   +6 more sources

Credible capacity evaluation of virtual power plants considering wind and PV uncertainties [PDF]

open access: yesScientific Reports
The 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

Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes

open access: goldIEEE Access
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.
Azimkhon Ostonov, Mikhail Moshkov
doaj   +2 more sources

Penerapan Non-Deterministic Finite Automata (NFA) dan Decision Making Menggunakan Algoritma Monte Carlo Tree Search (MCTS) Menentukan Perilaku Non-Player Character (NPC) Pada Game The Last Hope

open access: diamondJurnal CoSciTech (Computer Science and Information Technology), 2023
Perkembangan game juga berkembang pesat di Indonesia, banyak game baru yang tersebar di industri game. Para desainer game berlomba-lomba membuat game-game terbaru karena melihat peluang yang dihadirkan oleh banyaknya pengguna ponsel yang terbiasa bermain game. Pembuatan game ini dilakukan menggunakan software Unity 2D, menggunakan bahasa C# (C ...
Revie Danial Pramadya
openalex   +3 more sources

Randomized versus Deterministic Decision Tree Size [PDF]

open access: goldProceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Arkadev Chattopadhyay   +4 more
openalex   +2 more sources

Randomized vs. deterministic decision tree complexity for read-once Boolean functions [PDF]

open access: closedComputational Complexity, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Heiman, Avi Wigderson
openalex   +3 more sources

Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT [PDF]

open access: closed2012 IEEE 27th Conference on Computational Complexity, 2012
We show how to approximate any function in AC^0 by decision trees of much smaller height than its number of variables. More precisely, we show that any function in n variables computable by an unbounded fan-in circuit of AND, OR, and NOT gates that has size S and depth d can be approximated by a decision tree of height n - \beta n to within error exp(-\
Paul Beame   +2 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy