نتایج جستجو برای: 1 and minimum 3116 tonha
تعداد نتایج: 17243746 فیلتر نتایج به سال:
We analyze a new general representation for the Minimum Weight Steiner Tree (MST) problem which translates the topological connectivity constraint into a set of local conditions which can be analyzed by the so called cavity equations techniques. For the limit case of the Spanning tree we prove that the fixed point of the algorithm arising from the cavity equations leads to the global optimum. 1...
Since Gallager, Humblet and Spiru first introduced the distributed Minimum Spunning Tree problem, many authors have suggested ways to enhance their basic algorithm to improve its performance. Most of these improved algorithms have even been shown to be very eficient i n terms of reducing their worst-case communications and/or t ime complexity measures. In this paper, however, we take a differen...
this thesis basically deals with the well-known notion of the bear-invariant of groups, which is the generalization of the schur multiplier of groups. in chapter two, section 2.1, we present an explicit formula for the bear-invariant of a direct product of cyclic groups with respect to nc, c>1. also in section 2.2, we caculate the baer-invatiant of a nilpotent product of cyclic groups wuth resp...
Resistance distance was introduced by Klein and Randić. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all pairs of vertices. A graph G is called a cactus if each block of G is either an edge or a cycle. Denote by Cat(n; t) the set of connected cacti possessing n vertices and t cycles. In this paper, we give the first three smallest Kirchhoff indices among gra...
The method of optimal measurement counting time in Gamma spectrometry for soil samples was studied. Gamma spectrometry was done based on minimum detectable activity using the HPGe- p type with efficiency of 30% and FWHM 1.7keV (for 1.33 MeV 60Co). The samples were IAEA-RG Th-1, IAEA-RGU-1 and IAEA-RGK-1 prepared in bottles. The measurements were done for 12 different counting times from 5 min t...
This paper establishes a precise high-dimensional asymptotic theory for boosting on separable data, taking statistical and computational perspectives. We consider setting where the number of features (weak learners) p scales with sample size n, in an overparametrized regime. Under class models, we provide exact analysis generalization error when algorithm interpolates training data maximizes em...
This paper deals with the problem of General Shape Analysis. Simple shape measures based on a minimum bounding rectangle are investigated so as to obtain and compare general shape characteristics. The goal of General Shape Analysis is to find for each test object the one or few most similar templates. Thanks to this we can determine general information about a shape, such as how rectangular it ...
adolescents and young adults and their problems is an issue whose importance is obvious to anyone because youth are the founders of our countrys future and requires proper planning to be on leisure. given the importance of leisure,this study to investigate needs assessment and planning how adolescents and young adults spend their leisure time in urban of case study of high school girls and boys...
In this paper, we consider the inverse spanning tree problem. Given an undi0 Ž 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0, the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tree with respect to the < < < < cost vector d and the cost of perturbation given by d y c s Ý d y c i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید