Results 21 to 30 of about 249,007 (264)
This study describes the performance of Sugeno fuzzy logic in determining the amount of woven fabric production by using a combination of random tree decision trees in forming rules.
Tundo Tundo
doaj +1 more source
Fragmentation of random trees [PDF]
We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees,
Kalay, Z, Ben-Naim, E
openaire +2 more sources
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
Random Hyperplane Search Trees
Summary: A hyperplane search tree is a binary tree used to store a set \(S\) of \(n\) \(d\)-dimensional data points. In a random hyperplane search tree for \(S\), the root represents a hyperplane defined by \(d\) data points drawn uniformly at random from \(S\).
Devroye, L, King, J, McDiarmid, C
openaire +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
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
Simply generated trees, conditioned Galton―Watson trees, random allocations and condensation: Extended abstract [PDF]
We give a unified treatment of the limit, as the size tends to infinity, of random simply generated trees, including both the well-known result in the standard case of critical Galton-Watson trees and similar but less well-known results in the other ...
Svante Janson
doaj +1 more source

