Results 81 to 90 of about 1,848,326 (324)
Shortest Path Algorithms for Pedestrian Navigation Systems
Information, 2022 Efficient shortest path algorithms are of key importance for routing and navigation systems. However, these applications are designed focusing on the requirements of motor vehicles, and therefore, finding paths in pedestrian sections of urban areas is ...
Kyriakos Koritsoglou +3 more
doaj +1 more source
A Tight Bound for Shortest Augmenting Paths on Trees
, 2017 The shortest augmenting path technique is one of the fundamental ideas used in maximum matching and maximum flow algorithms. Since being introduced by Edmonds and Karp in 1972, it has been widely applied in many different settings.
Bosek, Bartłomiej +3 more
core +1 more source
FEBS Open Bio, EarlyView.What factors make for an effective digital learning tool in Higher Education? This systematic review identifies elements of a digital tool that published examples reveal to be features of an engaging and impactful digital tool. A systematic literature search yielded 25 research papers for analysis.
Akmal Arzeman +4 more
wiley +1 more source
Journal of Advanced Transportation, 2022 Traffic information and driving preference play critical roles in the route selection of drivers and further impact transport management in practice.
Shiguang Wang, Heng Ding, Zeyang Cheng
doaj +1 more source
Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae
FEBS Open Bio, EarlyView.Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj +3 more
wiley +1 more source
Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles
Journal of Telecommunications and Information Technology, 2018 The paper presents a new algorithm to determine the shortest, non-crossing, rectilinear paths in a twodimensional grid graph. The shortest paths are determined in a manner ensuring that they do not cross each other and bypass any obstacles present. Such
Shylashree Nagaraja
doaj +1 more source
On the Number of Shortest Weighted Paths in a Triangular Grid
Mathematics, 2020 Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its
Benedek Nagy, Bashar Khassawneh
doaj +1 more source
The Competition for Shortest Paths on Sparse Graphs [PDF]
, 2012 Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion.
Saad, David, Yeung, Chi Ho
core +2 more sources
Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications
FEBS Open Bio, EarlyView.This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley +1 more source
Engineering Shortest Path Algorithms [PDF]
, 2004 In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra’s shortest path algorithm.
DEMETRESCU, Camil, Giuseppe F. Italiano
openaire +2 more sources