Results 1 to 10 of about 5,474,085 (350)

Development of an Improved Rapidly Exploring Random Trees Algorithm for Static Obstacle Avoidance in Autonomous Vehicles. [PDF]

open access: yesSensors (Basel), 2021
Safe path planning for obstacle avoidance in autonomous vehicles has been developed. Based on the Rapidly Exploring Random Trees (RRT) algorithm, an improved algorithm integrating path pruning, smoothing, and optimization with geometric collision ...
Yang SM, Lin YA.
europepmc   +2 more sources

Coronary Artery Disease Diagnosis; Ranking the Significant Features Using a Random Trees Model. [PDF]

open access: yesInt J Environ Res Public Health, 2020
Heart disease is one of the most common diseases in middle-aged citizens. Among the vast number of heart diseases, coronary artery disease (CAD) is considered as a common cardiovascular disease with a high death rate. The most popular tool for diagnosing
Joloudari JH   +8 more
europepmc   +3 more sources

Tree limits and limits of random trees [PDF]

open access: yesCombinatorics, Probability and Computing, 2020
We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton–Watson trees and simply generated trees, for split ...
S. Janson
semanticscholar   +7 more sources

Random walks on random trees [PDF]

open access: bronzeJournal of the Australian Mathematical Society, 1973
Let T denote one of the nn−2 trees with n labelled nodes that is rooted at a given node x (see [6] or [8] as a general reference on trees). If i and j are any two nodes of T, we write i ∼ j if they are joined by an edge in T. We want to consider random walks on T; we assume that when we are at a node i of degree d the probability that we proceed to ...
J. W. Moon
openalex   +3 more sources

Optimal Prefetching in Random Trees [PDF]

open access: yesMathematics, 2021
We propose and analyze a model for optimizing the prefetching of documents, in the situation where the connection between documents is discovered progressively.
Kausthub Keshava   +2 more
doaj   +3 more sources

Predicting the Pillar Stability of Underground Mines with Random Trees and C4.5 Decision Trees

open access: yesApplied Sciences, 2020
Predicting pillar stability in underground mines is a critical problem because the instability of the pillar can cause large-scale collapse hazards. To predict the pillar stability for underground coal and stone mines, two new models (random tree and C4 ...
Mahmood Ahmad   +5 more
doaj   +2 more sources

Random ultrametric trees and applications* [PDF]

open access: yesESAIM: Proceedings and Surveys, 2017
Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time.
Lambert Amaury
doaj   +4 more sources

Rooted trees and moments of large sparse random matrices [PDF]

open access: diamondDiscrete Mathematics & Theoretical Computer Science, 2003
In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach.
Oleksiy Khorunzhiy
doaj   +2 more sources

optRF: Optimising random forest stability by determining the optimal number of trees [PDF]

open access: yesBMC Bioinformatics
Machine learning is frequently used to make decisions based on big data. Among these techniques, random forest is particularly prominent. Although random forest is known to have many advantages, one aspect that is often overseen is that it is a non ...
Thomas M. Lange   +3 more
doaj   +2 more sources

Multi-Goal Path Planning Using Multiple Random Trees [PDF]

open access: yesIEEE Robotics and Automation Letters, 2021
In this letter, we propose a novel sampling-based planner for multi-goal path planning among obstacles, where the objective is to visit predefined target locations while minimizing the travel costs.
Jaroslav Janoš   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy