Results 121 to 130 of about 749,587 (350)
Computing shortest paths in 2D and 3D memristive networks
, 2013 Global optimisation problems in networks often require shortest path length computations to determine the most efficient route. The simplest and most common problem with a shortest path solution is perhaps that of a traditional labyrinth or maze with a ...
Prodromakis, Themistoklis +2 more
core
Advanced Healthcare Materials, EarlyView.This review explores how advanced materials enhance Bio‐FETs for precision healthcare and biosensing. It covers their working principles, surface functionalization, and ultra‐sensitive detection capabilities. The integration of flexible designs, AI, and IoT for real‐time monitoring is discussed, along with challenges like material reproducibility and ...
Minal Pandey +5 more
wiley +1 more source
The time-varying shortest path problem with fuzzy transit costs and speedup
Acta Universitatis Sapientiae: Mathematica, 2016 In this paper, we focus on the time-varying shortest path problem, where the transit costs are fuzzy numbers. Moreover, we consider this problem in which the transit time can be shortened at a fuzzy speedup cost.
Rezapour Hassan, Shirdel Gholamhassan
doaj +1 more source
Maximum probability shortest path problem
Discrete Applied Mathematics, 2015 The maximum probability shortest path problem involves the constrained shortest path problem in a given graph where the arcs resources are independent normally distributed random variables. We maximize the probability that all resource constraints are jointly satisfied while the path cost does not exceed a given threshold.
Jianqiang Cheng, Abdel Lisser
openaire +4 more sources
Designing for Degradation: Transient Devices Enabled by (Nano)Cellulose
Advanced Materials, EarlyView.Recent progress in transient devices enabled by (nano)cellulosic materials is reviewed. Transiency mechanisms, advantages of nanocelluloses, and a suite of applications are discussed. A circular thinking approach coupled with life cycle assessment is applied to critically revisit the potential, advantages, and challenges of nanocellulose‐enabled ...
Lucas J. Andrew +2 more
wiley +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
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
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
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
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