نتایج جستجو برای: upper bound method
تعداد نتایج: 1945862 فیلتر نتایج به سال:
A frequently encountered problem in peer review systems is to facilitate pairwise comparisons of a given set of proposals by as few as referees as possible. In [8], it was shown that, if each referee is assigned to review k proposals then n(n-1)/k(k-1) referees are necessary and n(2n-k)/k referees are sufficient to cover all n(n-1)/2 pairs of n proposals. While the upper bound remains withi...
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
This paper investigates the efficiency loss of selfish routing simultaneously with user equilibrium (UE) player and Cournot-Nash (CN) players. The upper bound of the efficiency loss of UE-CN mixed equilibrium with polynomial cost functions is obtained by the scaling method and the nonlinear programming method, respectively. It is shown that the upper bound of efficiency loss obtained by the sca...
In supersymmetric models the lightest Higgs boson may decay with a sizable branching ratio into a pair of light neutralinos. We analyze such decays within the context of the minimal supersymmetric standard model with R-parity violation, where the neutralino itself is unstable and decays into Standard Model fermions. We show that the R-parity violating couplings induce novel Higgs decay signals ...
Kitahara and Mizuno (2011a) obtained an upper bound for the number of different solutions generated by the primal simplex method with Dantzig’s (the most negative) pivoting rule. In this paper, we obtain an upper bound with any pivoting rule which chooses an entering variable whose reduced cost is negative at each iteration. The bound is applied to special linear programming problems. We also g...
This paper presents and discusses a method for assuring an upper bound of the structured singular value (), by treating the frequency as a real parametric uncertainty on continuous time systems. Using this approach a complete frequency interval can be covered in one-computation. By subdividing the frequency range and using a pruning scheme an ee-cient and accurate method is obtained for computi...
Introduction In this paper, we intend to show that without any certain growth condition on the weight function, we always able to present a weighted sup-norm on the upper half plane in terms of weighted sup-norm on the unit disc and supremum of holomorphic functions on the certain lines in the upper half plane. Material and methods We use a certain transform between the unit dick and the uppe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید