نتایج جستجو برای: allocation maximal covering cooperative covering gradual covering metaheuristics
تعداد نتایج: 311224 فیلتر نتایج به سال:
1.1. We denote by V a connected ^-dimensional complete Riemannian manifold, by d = d(V) the diameter of V, and by c = c(V) and c~ = c~(V), respectively, the upper and lower bounds of the sectional curvature of V. We set c = c(V) = max (| c1, | c~ |). We say that F i s ε-flat, ε > 0, if cd < ε. 1.2. Examples. a. Every compact flat manifold is ε-flat for any ε > 0. b. Every compact nil-manifold p...
Let G be a finite Abelian group and D(G) its Davenport constant, which is defined as the maximal length of a minimal zero-sum sequence in G. We show that various problems on zero-sum sequences in G may be interpreted as certain covering problems. Using this approach we study the Davenport constant of groups of the form (Z/nZ)r , with n ≥ 2 and r ∈ N. For elementary p-groups G, we derive a resul...
We investigate the covering problem in RT spaces induced by the RosenbloomTsfasman metric, extending the classical covering problem in Hamming spaces. Some connections between coverings in RT spaces and coverings in Hamming spaces are derived. Several lower and upper bounds are established for the smallest cardinality of a covering code in an RT space, generalizing results by Carnielli, Chen an...
In 1914 Lebesgue defined a ‘universal covering’ to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by various mathematicians: Pál, Sprague and Hansen have each created a smaller universal covering by removing regions from those known before. However, Hansen’...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید