Results 1 to 10 of about 41,749 (283)
Interpretable molecular decision-making with DNA-based scalable and memory-efficient tree computation [PDF]
Nature CommunicationsDNA computing has emerged as a transformative paradigm for tackling computational problems at the molecular level, yet existing approaches remain constrained in algorithmic interpretability, efficiency, and scalability.
Junlan Liu +8 more
doaj +2 more sources
SpecMCTS: Accelerating Monte Carlo Tree Search Using Speculative Tree Traversal
IEEE Access, 2021 Monte Carlo Tree Search (MCTS) algorithms show outstanding strengths in decision-making problems such as the game of Go. However, MCTS requires significant computing loads to evaluate many nodes in the decision tree to make a good decision. Parallelizing
Juhwan Kim, Byeongmin Kang, Hyungmin Cho
doaj +1 more source
Representation of binary classification trees with binary features by quantum circuits [PDF]
Quantum, 2022 We propose a quantum representation of binary classification trees with binary features based on a probabilistic approach. By using the quantum computer as a processor for probability distributions, a probabilistic traversal of the decision tree can be ...
Raoul Heese +2 more
doaj +1 more source
Novel Static Multi-Layer Forest Approach and Its Applications
Mathematics, 2021 The existing multi-layer tree is of dynamic linked list type which has many limitations and is complicated due to the pointer-node structure. Static array representation gives more flexibility in programming of algorithms and operations like insertion ...
Ganesh Bhagwat +3 more
doaj +1 more source
Deep Forest and Pruned Syntax Tree-Based Classification Method for Java Code Vulnerability
Mathematics, 2023 The rapid development of J2EE (Java 2 Platform Enterprise Edition) has brought unprecedented severe challenges to vulnerability mining. The current abstract syntax tree-based source code vulnerability classification method does not eliminate irrelevant ...
Jiaman Ding, Weikang Fu, Lianyin Jia
doaj +1 more source
Descendants and ascendants in binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 There are three classical algorithms to visit all the nodes of a binary tree - preorder, inorder and postorder traversal. From this one gets a natural labelling of the n internal nodes of a binary tree by the numbers 1, 2, ..., n, indicating the sequence
Alois Panholzer, Helmut Prodinger
doaj +3 more sources
TreeSwift: A massively scalable Python tree package
SoftwareX, 2020 Phylogenetic trees are essential to evolutionary biology, and numerous methods exist that attempt to extract phylogenetic information applicable to a wide range of disciplines, such as epidemiology and metagenomics.
N. Moshiri
doaj +1 more source
Journal of Hydroinformatics, 2023 Wavelet-based grid resolution adaptation driven by the ‘multiresolution analysis’ (MRA) of the Haar wavelet (HW) allows to devise an adaptive first-order finite volume (FV1) model (HWFV1) that can readily preserve the modelling fidelity of its reference ...
Alovya Ahmed Chowdhury +3 more
doaj +1 more source
In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes
IEEE Access, 2022 Polar codes are the first capacity-achieving error-correction code which has attracted much research attention. Among many decoding methods, successive cancellation list decoding (SCLD) is considered as a representative decoding method that can achieve a
Jaehyeon Park +2 more
doaj +1 more source
Multi-Robot Persistent Surveillance With Connectivity Constraints
IEEE Access, 2020 Mobile robots, especially unmanned aerial vehicles (UAVs), are of increasing interest for surveillance and disaster response scenarios. We consider the problem of multi-robot persistent surveillance with connectivity constraints where robots have to ...
Jurgen Scherer, Bernhard Rinner
doaj +1 more source