Results 121 to 130 of about 779,089 (370)
Solving the Robust Shortest Path Problem with Multimodal Transportation
MathematicsThis paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can ...
Jinzuo Guo +3 more
doaj +1 more source
L. A. Lyusternik, Shortest Paths–Variational Problems (Popular Lectures in Mathematics, Pergamon Press, Oxford, 1964), x+102 pp., 17s. 6d. [PDF]
, 1966 R. P. Gillespie
openalex +1 more source
Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks [PDF]
arXiv, 2010 A problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect biochemical facts. An approach to overcome this issue is to use edge labels and search for paths with distinct labels.
arxiv
Constrained shortest paths and related problems
, 2001 The classical shortest path problem, to find a path of minimal cost between two nodes in a graph, is efficiently solvable in polynomial time. However, in many applications we also have additional budget or resource constraints on a path. This problem is known as constrained shortest path problem and unfortunately belongs to the class of "hard" problems
openaire +3 more sources
Enhancing Ultrasound Power Transfer: Efficiency, Acoustics, and Future Directions
Advanced Materials, EarlyView.Implantable devices significantly enhance healthcare but are limited by battery life. Ultrasound power transfer technology offers a promising solution for sustainable operation. This review addresses gaps in current research, particularly in sound field analysis and energy efficiency optimization.
Yi Zheng +6 more
wiley +1 more source
Computing L1 Shortest Paths among Polygonal Obstacles in the Plane [PDF]
arXiv, 2012 Given a point $s$ and a set of $h$ pairwise disjoint polygonal obstacles of totally $n$ vertices in the plane, we present a new algorithm for building an $L_1$ shortest path map of size O(n) in $O(T)$ time and O(n) space such that for any query point $t$, the length of the $L_1$ shortest obstacle-avoiding path from $s$ to $t$ can be reported in $O(\log
arxiv
Link distance and shortest path problems in the plane
Computational Geometry, 2009 AbstractThis paper describes algorithms to compute Voronoi diagrams, shortest path maps, the Hausdorff distance, and the Fréchet distance in the plane with polygonal obstacles. The underlying distance measures for these algorithms are either shortest path distances or link distances.
Atlas F. Cook, Carola Wenk
openaire +5 more sources
Developing Cathode Films for Practical All‐Solid‐State Lithium‐Sulfur Batteries
Advanced Materials, EarlyView.The development of all‐solid‐state lithium‐sulfur batteries offers higher specific energies and lower costs compared to state‐of‐the‐art Li‐ion batteries. However, a lack of mechanistic understanding hinders advancement. This review analyzes key electrode parameters, evaluates progress in enhancing ion/electron percolation, and addresses ...
Chao Ye +4 more
wiley +1 more source
An Analysis of Stochastic Shortest Path Problems [PDF]
, 1991 Dimitri P. Bertsekas, John N. Tsitsiklis
openalex +1 more source
Advanced Materials, EarlyView.In this review, the recent development of deep‐blue (≤465 nm) perovskite light‐emitting diodes (PeLEDs) are summarized, using different perovskite nanomaterials, including nanocrystals (NCs), quantum dots (QDs), nanoplatelets (NPLs), quasi‐2D thin film, 3D bulk thin film, as well as lead‐free perovskite nanomaterials.
Pui Kei Ko +6 more
wiley +1 more source