نتایج جستجو برای: maximal covering

تعداد نتایج: 139415  

Journal: :Applied system innovation 2022

Planning and defining places for the installation of police facilities are fundamental to improving public security service in urban space. Geographic Information Systems connecting spatial distribution occurrences, budgetary restrictions, maximum distance covered state-of-the-art innovations addressing need preventive responsive management. The present work proposes a management information sy...

2004
Burt Totaro

The torsion index is a positive integer associated by Grothendieck to any connected compact Lie group G [10]. Knowing the torsion index of a group has direct consequences for the integral cohomology of the classifying space BG, the complex cobordism of BG, the Chow ring of BG, and the classification of G-torsors over fields. These applications of the torsion index are summarized in my paper [25...

Journal: :CoRR 2006
Maximilien Gadouleau Zhiyuan Yan

In this paper, we study properties of rank metric codes in general and maximum rank distance (MRD) codes in particular. For codes with the rank metric, we first establish Gilbert and sphere-packing bounds, and then obtain the asymptotic forms of these two bounds and the Singleton bound. Based on the asymptotic bounds, we observe that asymptotically Gilbert-Varsharmov bound is exceeded by MRD co...

The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...

2009
David A. Schilling

In this paper, we extend the concepts of demand data aggregation error to location problems involving coverage. These errors, which arise flora losses in locational information, may lead to suboptimal location patterns. They are potentially more significant in covering problems than in p-median problernsIbecause the distance metric is binary in covering problems. We examine the Hillsirtan and R...

2001
Franz Gähler Michael Reichert

Two different relaxed versions of Gummelt’s aperiodic cluster covering rules are considered. These relaxed covering rules produce certain random tiling type structures, which are precisely characterized, along with their relationships to various other random tiling ensembles. One variant of the relaxed covering rules allows for a natural realization in terms of a vertex cluster. It is shown wit...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید