نتایج جستجو برای: allocation maximal covering cooperative covering gradual covering metaheuristics
تعداد نتایج: 311224 فیلتر نتایج به سال:
This paper gives a proof that the universal cover of a closed 3-manifolds built from three π1-injective handlebodies is homeomorphic to R .
We prove that the set of homotopy classes of the paths in a topological ring is a ring object (called ring groupoid). Using this concept we show that the ring structure of a topological ring lifts to a simply connected covering space.
The purpose of this note is to use covering space theory to construct new examples of buildings. On the level of Coxeter systems, this contsruction was described previously in Davis [4]. It goes as follows. Start with a Coxeter system (W ′, S). Change some m(s, t)’s in its Coxeter matrix from integers ≥ 2 to the symbol ∞ . This defines a new Coxeter system (W, S). Suppose C′ is a building of ty...
This article contains a new argument which proves vanishing of the first cohomology for negative vector bundles over a complex projective variety if the rank of the bundle is smaller than the dimension of the base. Similar argument is applied to the construction of holomorphic functions on the universal covering of the complex projective variety .
This paper describes certain properties of the fundamental group of the shrinking wedge of circles. Covering space theory is an inadequate tool since the shrinking wedge of circles is not semi-locally simply connected. We conclude with the fact that the shrinking wedge of circles is not homotopy equivalent to the wedge product of a countable number of circles.
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
In the lattice of subsets of an n-set X , every maximal Sperner family S may be partitioned into disjoint subfamilies A and B, such that the union of the upset of A with the downset of B yields the entire lattice: U(A) [ D(B) = 2 X . The result generalizes to certain posets.
The distribution or delivery process is one factor that affect customer satisfaction as the goal of supply chain. In order for chain to be competitive in competition, time an important manage, so it could provide high service level value. One affects center location. A strategic location would facilitate and speed up process. This research discusses model determining made at right amount by ana...
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of points of P . In case of overlapping, the points in their common zone are counted once. To solve the problem, we propose an algorithm that runs in O(n log n) time using O(n log n) space.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید