نتایج جستجو برای: conite subset
تعداد نتایج: 100145 فیلتر نتایج به سال:
The paper deals with the reliability–based design optimization (RBDO) of concrete gravity dams subjected to earthquake load using subset simulation. The optimization problem is formulated such that the optimal shape of concrete gravity dam described by a number of variables is found by minimizing the total cost of concrete gravity dam for the given target reliability. In order to achieve this p...
Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...
in the transformation semigroup (x, s) we introduce the height of a closed nonempty invariant subset of x, define the transformed dimension of nonempty subset s of x and obtain some results and relations.
chapters 1 and 2 establish the basic theory of amenability of topological groups and amenability of banach algebras. also we prove that. if g is a topological group, then r (wluc (g)) (resp. r (luc (g))) if and only if there exists a mean m on wluc (g) (resp. luc (g)) such that for every wluc (g) (resp. every luc (g)) and every element d of a dense subset d od g, m (r)m (f) holds. chapter 3 inv...
Let $R$ be an infinite ring. Here we prove that if $0_R$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin X}$ for every infinite subset $X$ of $R$, then $R$ satisfies the polynomial identity $x^n=0$. Also we prove that if $0_R$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in X}$ for every infinite subset $X$ of $R$, then $x^n=x$ for all $xin R$.
Subset Interconnection Design is an NP −hard problem which draws its motivation from various applications, such as the design of scalable overlay networks, the inference of inter-molecular protein connectivity, the design of vacuum systems and several other problems in the industry. In that problem, we are given a set of vertices V and a collection S of subsets of V and we want to find an edge ...
In the field of algorithmic analysis, one of the more well-known exercises is the subset sum problem. That is, given a set of integers, determine whether one or more integers in the set can sum to a target value. Aside from the brute-force approach of verifying all combinations of integers, several solutions have been found, ranging from clever uses of various data structures to computationally...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید