Results 31 to 40 of about 258,206 (308)
Path Planning Algorithms: An Evaluation of Five Rapidly Exploring Random Tree Methods
Path planning is one element of mobile robot navigation. It helps a robot arrive at its destination safely by defining its route from the start to the end locations.
Roberts, Rodney, Jermyn, Jacqueline
core +1 more source
Inspired by the phototropism of plants, a novel variant of the rapidly exploring random tree algorithm as called phototropism rapidly exploring random tree is proposed.
Chengchen Zhuge +3 more
doaj +1 more source
Prediction of Employee Attendance Factors Using C4.5 Algorithm, Random Tree, Random Forest
Research on the performance of workers based on the determination of standard working hours for absences conducted by workers in a certain period.
Riza Fahlapi +5 more
doaj +1 more source
Comparative Study of Various Wireless Sensor Network (WSN) Topology Construction Protocols [PDF]
As the cost for wireless sensors and wireless sensor networks (WSNs) have decreased, they have become more ubiquitous; they are increasingly being used in many applications such as security, structural monitoring and environmental monitoring.
Lifford McLauchlan +3 more
doaj +1 more source
Parallelizing RRT on large-scale distributed-memory architectures [PDF]
This paper addresses the problem of parallelizing the Rapidly-exploring Random Tree (RRT) algorithm on large-scale distributed-memory architectures, using the Message Passing Interface.
Devaurs, Didier +2 more
core +1 more source
Random ultrametric trees and applications*
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 +1 more source
Optimization of Data-Driven Soil Temperature Forecast—The First Model in Bangladesh
Soil temperature patterns are of great importance for any agro-based economy like Bangladesh since they significantly affect biological, chemical, and physical processes that take place in the soil.
Lipon Chandra Das +2 more
doaj +1 more source
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees [PDF]
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree.
openaire +3 more sources
AbstractWe consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek.
Benjamini, Itai +2 more
openaire +3 more sources
Optimal randomized classification trees [PDF]
This research has been financed in part by research projects EC H2020 MSCA RISE NeEDS (Grant agreement ID: 822214), FQM-329 and P18-FR-2369 (Junta de Andaluc\'ia), and PID2019-110886RB-I00 (Ministerio de Ciencia, Innovaci\'on y Universidades, Spain).
Rafael Blanquero +3 more
openaire +3 more sources

