نتایج جستجو برای: detour index

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

Journal: :Sustainability 2022

In the process of walking, most pedestrians prefer to choose shortest path, which requires passing through conflict area. However, in case high crowd density, 5–20% total population will follow pre-planned route before walking or during initial period trip bypass Aiming at reproducing this detour behavior phenomenon, an extended social force model (SFM) is proposed according a three-layer pedes...

Journal: :Mathematics 2022

In this paper, we consider the problem of feature reconstruction from incomplete X-ray CT data. Such data problems occur when number measured X-rays is restricted either due to limit radiation exposure or practical constraints, making detection certain rays challenging. Since image a severely ill-posed (unstable) problem, reconstructed images may suffer characteristic artefacts missing features...

Journal: :Phainomenon 2021

Abstract This paper focuses on the main claim of Umberto Eco’s Open Work , according to which any work art is an inherently ambiguous message, i.e. inexhaustible, or in principle likely be object infinite number interpretations. It does so, first, by restricting itself specific topic literary art, and, secondly, making a detour, that Eco himself suggests, though he not really explore it, via Sa...

Journal: :AKCE International Journal of Graphs and Combinatorics 2016

Journal: :Australasian J. Combinatorics 2014
Modjtaba Ghorbani Nasrin Azimi

Let G be a connected graph and let μ(G) = DD(G) − W (G), where DD(G) and W (G) stand for the detour and Wiener numbers of G, respectively. Nadjafi-Arani et al. [Math. Comput. Model. 55 (2012), 1644– 1648] classified connected graphs whose difference between Szeged and Wiener numbers are n, for n = 4, 5. In this paper, we continue their work to prove that for any positive integer n = 1, 2, 4, 6 ...

1991
Rolf Klein

A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s t o g are mutually weakly visible. For a mobile robot with on-board vision system we describe a strategy for finding a short path from s t o g in a street not known in advance, and prove that the length of the path created does not exceed 1 + 2. times the length of the shortest path from s ...

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

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