Results 231 to 240 of about 286,084 (291)

A Scoping Review of Microsimulation Models on Obesity-Related Policy Evaluation. [PDF]

Nutrients
Cao Z, Fang Y, Wang C, An R.
europepmc   +1 more source

Cloud-based DDoS detection using hybrid feature selection with deep reinforcement learning (DRL). [PDF]

Sci Rep
Satpathy S, Tripathy U, Swain PK.
europepmc   +1 more source

Tree-based ensemble learning models for protein-protein interactions detection: a review and experimental evaluation. [PDF]

BioData Min
Taha K.
europepmc   +1 more source

Optimizing solar farm interconnection networks using graph theory and metaheuristic algorithms with economic and reliability analysis. [PDF]

Sci Rep
Ghias-Nodoushan A, Sedighi-Anaraki A, Jannesar MR, Saeedi-Sourck H.   +3 more
europepmc   +1 more source

Dynamic quality aware path planning for 6 DoF robotic arms using BiRRT and metaheuristic optimization based on B spline paths. [PDF]

Sci Rep
Elgohr AT, Rashad M, El-Gendy EM, Shaaban W, Saafan MM.   +4 more
europepmc   +1 more source

LandScan mosaic enables high-resolution gridded population estimates with explicit uncertainty. [PDF]

Sci Rep
Adams DS, Zimmer A, Tuccillo J, Moehl J, Stewart R, Walters S, Bhaduri B, Li P, Urban M.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Lower Bounds on Complexity of Deterministic Decision Trees for Decision Tables

, 2020
In this chapter, lower bounds on complexity of deterministic decision trees for decision tables are studied that are based on the notions of super-cover, super-partition, test, and system of representatives for decision tables. An approach to the proof of lower bounds is also considered which is based on the use of so-called proof-trees.
M. Moshkov
semanticscholar   +2 more sources

Comparative Analysis of Deterministic and Nondeterministic Decision Trees

Intelligent Systems Reference Library, 2020
This book compares four parameters of problems in arbitrary information systems: complexity of problem representation and complexity of deterministic, nondeterministic, and strongly nondeterministic decision trees for problem solving. Deterministic decision trees are widely used as classifiers, as a means of knowledge representation, and as algorithms.
M. Moshkov
semanticscholar   +3 more sources

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

2023 IEEE International Conference on Big Data (BigData), 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, M. Moshkov
semanticscholar   +2 more sources