نتایج جستجو برای: bucket recursive trees with variable capacitiesof buckets
تعداد نتایج: 9303595 فیلتر نتایج به سال:
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
Since record polymorphism is one of essential factors for object-oriented languages, various approaches to incorporate record polymorphism into type systems have been proposed to lay the foundation for object-oriented languages. Recursive types, which are essentially types of lists or trees, are major programming tools. In object-oriented languages, a pseudo variable \self" has a recursive type...
Based on uniform recursive trees, we introduce random trees with the factor of time, which are named Yule recursive trees. The structure and the distance between the vertices in Yule recursive trees are investigated in this paper. For arbitrary time t > 0, we first give the probability that a Yule recursive tree Yt is isomorphic to a given rooted tree γ ; and then prove that the asymptotic dist...
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Within this framework, we introduce a new algorithm, called bucket-tree elimination (BTE), that extends Bucket Elimination (BE) to trees, and show that it can ...
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the cliquetree algorithm for probabilistic reasoning. Within this framework, we introduce a new algorithm, called bucket-tree elimination (BTE), that extends Bucket Elimination (BE) to trees, and show that it can p...
We present the results concerning the embedding of trees into recursive circulants. Recursive circulant G(N,:,/) is a circulant graph with N vertices and jumps of powers of d. We present dilation 1 embedding of Fibonacci trees and full quaternaly trees in G(Z”, 2), and full binary trees and hinomial trees in G(2”,4).
In this study, a 3D-CFD simulation on the effect of various design and operating parameters, namely number blades, overlap ratio, spacing size, arc angle, shape factor, presence curtain, wind velocity, multi-bucket rotor, aerodynamic performance Savonius vertical axis turbine (VAWT) is conducted. order to evaluate each parameter, rotor’s power coefficient (Cp) for different tip speed ratio (TSR...
Popcorn is an important crop that grown for consumption and snacks production in Nigeria however; it has low poor yield to meet the demand country. This study was conducted determine effect of magnetic treatment irrigation water (MTIW) on percentage germination (GP), growth rate (GR), popping-quality popcorn under deficit irrigation. MTIW produced by passing through pipe surrounded with neodymi...
Social housing of preweaned calves can benefit their welfare, but and cross sucking are potential barriers to adoption for farmers. For farms using outdoor hutches, an option is pair adjacent hutches with a shared fence. Our objective was investigate milk- or starter-feeding strategies mitigate in this system. Holstein heifers were housed pairs (n = 32 pairs) divided into 4 treatments 8 each) 2...
A hash table is a representation of a set in a linear size data structure that supports constant-time membership queries. We show how to construct a hash table for any given set of n keys in O(lg lg n) parallel time with high probability, using n processors on a weak version of a concurrent-read concurrent-write parallel random access machine (crcw pram). Our algorithm uses a novel approach of ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید