Results 331 to 340 of about 6,285,799 (375)
Some of the next articles are maybe not open access.
Efficient Sampling With Q-Learning to Guide Rapidly Exploring Random Trees
IEEE Robotics and Automation Letters, 2018This letter presents a novel approach for efficient sampling of Rapidly-exploring Random Trees (RRTs) based upon learning a state-action value function (Q-function).
Jinwook Huh, Daniel D. Lee
semanticscholar +1 more source
Statistics & Probability Letters, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konsowa, Mokhtar H., Oraby, Tamer F.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Konsowa, Mokhtar H., Oraby, Tamer F.
openaire +2 more sources
Random Censoring and Dendritic Trees
Biometrics, 1977The motivating problem is the estimation of the branching parameters of dendritic trees when some of the branches are cut. A primary element of this problem is the estimation of a bivariate discrete distribution when, because of partial censoring, some of the observations are incomplete.
G P, McCabe, M L, Samuels
openaire +2 more sources
Random Sequential Adsorption on Random Trees
Journal of Statistical Physics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random Structures & Algorithms, 1994
AbstractCartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. If the search key and the priority key are independent, and the trees is built based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees.
openaire +1 more source
AbstractCartesian trees are binary search trees in which the nodes exhibit the heap property according to a second (priority) key. If the search key and the priority key are independent, and the trees is built based on n independent copies, Cartesian trees basically behave like ordinary random binary search trees.
openaire +1 more source
Probability in the Engineering and Informational Sciences, 2002
We prove that the effective resistances of spherically symmetric random trees dominate in mean the effective resistances of random trees corresponding branching processes in varying environments and having the same growth law of spherically symmetric trees.
openaire +2 more sources
We prove that the effective resistances of spherically symmetric random trees dominate in mean the effective resistances of random trees corresponding branching processes in varying environments and having the same growth law of spherically symmetric trees.
openaire +2 more sources
30th Annual Symposium on Foundations of Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
Random trees and random graphs
Random Structures and Algorithms, 1998Summary: We study the asymptotic behavior of the number of trees with \(n\) vertices and diameter \(k= k(n)\), where \((n- k)/n\to a\) as \(n\to\infty\) for some constant \(a< 1\). We use this result to determine the limit distribution of the diameter of the random graph \(G(n,p)\) in the subcritical phase.
openaire +2 more sources
RANDOM WALKS AND DIMENSIONS OF RANDOM TREES
Infinite Dimensional Analysis, Quantum Probability and Related Topics, 2010We study the relationship between the type of the random walk on some random trees and the structure of those trees in terms of fractal and resistance dimensions. This paper generalizes some results of Refs. 8–10.
openaire +1 more source
Journal of Algorithms, 1983
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire +1 more source
Abstract Dans cet article, nous proposons un algorithme de complexite polynomiale pour construire un arbre au hasard qui soit un graphe partiel d'un graphe donne. Il consiste essentielleement a construire une arborescence de rang donne sur ce graphe, l'ensemble des arborescences etant ordonne par rapport aux valeurs croissantes de la racine et a ...
openaire +1 more source