Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 82 for “"Random trees"”.

  1. Conformal welding of uniform random trees

    … limits of the maps for the uniform measure on random walk excursions as the number of steps goes to infinity, normalized by conformal radius, and we show that subsequential limits are almost surely nontrivial. Additionally, we investigate the properties of laminations resulting from consistent …

    washington Repository record for Conformal welding of uniform random trees (opens in a new tab)

  2. Random trees, fires and non-crossing partitions

    Trees play a fundamental role in various areas of mathematics such as combinatorics, graph theory, population genetics, and theoretical computer science. In the first part of this thesis, we consider fires on large random trees. We dfine dynamics where, as time goes by, fires start randomly on a …

    zurich

  3. Percolating, cutting-down and scaling random trees

    Trees are a fundamental notion in graph theory and combinatorics as well as a basic object for data structures, algorithms in computer science, statistical physics and the study of epidemics propagating in a network. In recent years, (random) trees have been the subject of many studies and various …

    zurich

  4. Scaling limits of random trees and graphs

    … establish the scaling limit of several models of random trees and graphs, enlarging and completing the now long list of random structures that admit David Aldous' continuum random tree (CRT) as scaling limit. Our results answer important open questions, in particular the conjecture by Aldous for …

    lmu-germany Repository record for Scaling limits of random trees and graphs (opens in a new tab)

  5. Information theory of random trees induced by stochastic grammars.

    … been done on the information theory of binary random rooted tree models in which every nonleaf vertex in a tree has exactly two children. Let α be a positive integer parameter > 2. The main contribution of this thesis is to extend the information theory results for binary random tree models to …

    umn Repository record for Information theory of random trees induced by stochastic grammars. (opens in a new tab)

  6. Single-Query Robot Motion Planning using Rapidly Exploring Random Trees (RRTs)

    Robots moving about in complex environments must be capable of determining and performing difficult motion sequences to accomplish tasks. As the tasks become more complicated, robots with greater dexterity are required. An increase in the number of degrees of freedom and a desire for autonomy in …

    manitoba Repository record for Single-Query Robot Motion Planning using Rapidly Exploring Random Trees (RRTs) (opens in a new tab)

  7. Recursive construction of continuum random trees and some contributions to the theory of tree-valued stochastic processes

    … general recursive method to construct continuum random trees (CRTs) from i.i.d. copies of a string of beads, that is, any random interval equipped with a random discrete measure. We prove the existence of these CRTs as a new application of the fixpoint method formalised in high generality by …

    oxford Repository record for Recursive construction of continuum random trees and some contributions to the theory of tree-valued stochastic processes (opens in a new tab)

  8. Automated Generation of Training Programs for Swimmers Generating Weekly Training Plans in the Style of a Professional Swimming Coach Using Genetic Algorithms and Random Trees

    Optimal training planning is a combination of art and science, and a task that requires expert knowledge. This is a time-consuming task that is often exclusively available to top tier athletes. Many athletes outside the elite do not have access or cannot afford to hire a professional coach to help …

    chalmers Repository record for Automated Generation of Training Programs for Swimmers Generating Weekly Training Plans in the Style of a Professional Swimming Coach Using Genetic Algorithms and Random Trees (opens in a new tab)

  9. Predicting Health Insurance Claim Costs: A Data-Driven Approach Using Machine Learning

    … lеarning tеchniquеs, such as XGBoost Tree 1, Random Trees 1, Linear-AS 1, LSVM 1, and Neural Net 1 to еnhancе cost prеdictions; Evaluatе thе pеrformancе of diffеrеnt prеdictivе modеls using rеal- world hеalth insurancе data; and Assеss thе implications of modеl accuracy and its rеlеvancе to …

    rit Repository record for Predicting Health Insurance Claim Costs: A Data-Driven Approach Using Machine Learning (opens in a new tab)

  10. The structure of large random graphs

    … obtain universality results on the structure of random graphs from two different angles. Naturally, there is a trade-off between the generality of the assumptions on a model and the specificity of the results one may obtain. The strength of the first work is its generality: we obtain …

    oxford Repository record for The structure of large random graphs (opens in a new tab)

  11. Multi-Goal Path Planning for Inventory Tracking

    … algorithms based on RRT (rapidly exploring random trees) and RRT* (optimal rapidly exploring random trees) are studied and compared in three simulated environments with obstacles. Computer simulation results show that, the modified RRT* algorithm with node reuse achieves the best performance …

    calpoly Repository record for Multi-Goal Path Planning for Inventory Tracking (opens in a new tab)

  12. ROOST SELECTION BY RAFINESQUE'S BIG-EARED BATS, Corynorhinus rafinesquii, IN CONGAREE NATIONAL PARK - A MULTISCALE APPROACH

    … areas of old-growth bottomland forest. Roost trees were located via tree searches and radio-telemetry and I used univariate tests and multiple logistic regression to compare tree, stand, and landscape characteristics of roosts to those of randomly selected trees in similar habitats. I located …

    clemson Repository record for ROOST SELECTION BY RAFINESQUE'S BIG-EARED BATS, Corynorhinus rafinesquii, IN CONGAREE NATIONAL PARK - A MULTISCALE APPROACH (opens in a new tab)

  13. Safe navigation and path planning for multiagent systems with control barrier functions

    … extension of the CBF guided rapidly-exploring random trees (CBF-RRT) to demonstrate how the CBF Toolbox can be applied. This work addresses the theory behind the CBF Toolbox, as well as presenting examples of how it is applied to multiagent systems. Examples are shown for its use in both …

    bu Repository record for Safe navigation and path planning for multiagent systems with control barrier functions (opens in a new tab)

  14. Plánování cesty neholonomního mobilního robotu

    … se jedná o metody: RRT (Rapidly-Exploring Random Trees), IGPPR (The Intelligent Global Path Planner With Replanning) a ISSD (Incorporating State Space Discretization). Teoretická část je věnována dosavadním přístupům k plánování cesty a vysvětlení výše zmíněných algoritmů. Praktická část …

    brno-tech Repository record for Plánování cesty neholonomního mobilního robotu (opens in a new tab)

  15. Path-planning algorithms in high-dimensional spaces

    … integrated in the framework of Rapidly-exploring Random Trees to introduce the Deformable Rapidly-exploring Random Trees algorithm. This algorithm rapidly finds a feasible solution, similarly to the other RRT algorithms, and it also significantly increases the convergence rate of the solution …

    gatech Repository record for Path-planning algorithms in high-dimensional spaces (opens in a new tab)

  16. Evaluating faults detection and their impact on Photovoltaic (PV) Modules

    … Linear Support Vector Machine (LSVM), Random Trees, and Neural Networks, to detect and categorize faults, including voltage loss, current degradation, and series resistance issues. Data preprocessing involved exploratory data analysis (EDA), outlier detection, and dimensionality …

    rit Repository record for Evaluating faults detection and their impact on Photovoltaic (PV) Modules (opens in a new tab)

  17. Enhancing Community Conservation Efforts for Pest Plant Eradication Using Low-Altitude Remote Sensing

    … object-based Support Vector Machine and Random Trees. We tested nine segmentation parameters for each classier. Out of the nine segmentation parameters, parameters 2 and 8 performed the best for Random Trees and Support Vector Machine with an average of 60% and Kappa of 54%. However, …

    auckland-tech Repository record for Enhancing Community Conservation Efforts for Pest Plant Eradication Using Low-Altitude Remote Sensing (opens in a new tab)

  18. SUMMER ROOSTING ECOLOGY OF CHIROPTERA IN THE WEST GULF COASTAL PLAIN OF ARKANSAS

    … vegetative variables at both the roost and random trees, along with their associated plots. We determined our random trees/plots by using a random number generator to give us a random azimuth and distance between 50–100 m. In 2025, we captured 11 tricolored bats and successfully tracked …

    ut-knoxville Repository record for SUMMER ROOSTING ECOLOGY OF CHIROPTERA IN THE WEST GULF COASTAL PLAIN OF ARKANSAS (opens in a new tab) Embargoed until 2027-05-01

  19. Propagation and performance analysis for a 915 MHz wireless IR image transfer system

    … capabilities. Data transmission through random trees, buildings, foliage under various atmospheric conditions is also evaluated for outdoor system capabilities. A maximum free space range for acceptable IR image transferring is determined as 23 miles for line of sight (LOS). Non line of …

    nps Repository record for Propagation and performance analysis for a 915 MHz wireless IR image transfer system (opens in a new tab)

Page 1 of 5