Results 21 to 30 of about 258,206 (308)
Mathematics, 2020 The amount of water allocated to irrigation systems is significantly greater than the amount allocated to other sectors. Thus, irrigation water demand management is at the center of the attention of the Ministry of Agriculture and Forestry in Turkey.
Mohammad Taghi Sattari +2 more
doaj +1 more source
Random Generation of Nondeterministic Finite-State Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Algorithms for (nondeterministic) finite-state tree automata (FTAs) are often tested on random FTAs, in which all internal transitions are equiprobable.
Thomas Hanneforth +2 more
doaj +1 more source
Discrete Applied Mathematics, 2019 Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support we show that $1.41805386^n \le c(n) \le 1.41959881^n$. Moreover, there is a strong indication that, in fact, $c(n) \
Bogumil Kaminski, Pawel Pralat
openaire +2 more sources
Parking on a Random Tree [PDF]
Journal of Statistical Physics, 2008 Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking RSA: at every vertex of the tree a particle (or car) arrives with rate one.
Dehling, H. G. +2 more
openaire +4 more sources
Scaling limit for the random walk on the largest connected component of the critical random graph [PDF]
, 2012 In this article, a scaling limit for the simple random walk on the largest connected component of the Erdos-Rényi random graph G(n,p) in the critical window, p = n−1+λn−4/3, is deduced.
Croydon, David A.
core +1 more source
Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI), 2021 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
Density-Based Detection Rapid Exploration Random Tree for Multirobot Formation Cooperative Path Planning. [PDF]
Sensors (Basel)This paper proposes a multirobot formation path planning method based on the leader–follower formation control method to ensure smooth operation in the multirobot formation control area. First, on the basis of the rapidly exploring random tree (RRT)
Shi Y +5 more
europepmc +2 more sources
Fragmentation of random trees [PDF]
Journal of Physics A: Mathematical and Theoretical, 2014 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
A Gibbsian random tree with nearest neighbour interaction
, 2022 We revisit the random tree model with nearest-neighbour interaction as described in previous work, enhancing growth. When the underlying free Bienaym\'e-Galton-Watson (BGW) model is sub-critical, we show that the (non-Markov) model with interaction ...
Collet, Pierre +7 more
core +2 more sources
, 2022 We consider the process of uncovering the vertices of a random labeled tree according to their labels. First, a labeled tree with n vertices is generated uniformly at random. Thereafter, the vertices are uncovered one by one, in order of their labels. With each new vertex, all edges to previously uncovered vertices are uncovered as well.
Benjamin Hackl +2 more
openaire +4 more sources