Results 151 to 160 of about 779,089 (370)
Advanced Materials, EarlyView.A novel dual‐modification approach, ─NH₂ groups modification and Cu ions coordination, is first imposed on MIL‐125, which greatly improved carrier separation due to the enhanced piezoelectricity of MOFs caused by polarity alteration, leading to exceptional high piezo‐photocatalytic hydrogen production.
Haijun Hu +11 more
wiley +1 more source
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets [PDF]
, 2002 T. B. Boffey +3 more
openalex +1 more source
Shortest Path Problems in Weighted Regions
La búsqueda de caminos mínimos es uno de los problemas más estudiados en el campo de la geometría computacional. En esta tesis nos hemos centrado en caminos mínimos en escenarios geométricos, un entorno que tiene muchas aplicaciones en robótica, computación gráfica y sistemas de información geográfica.
openaire +2 more sources
Advanced Materials, EarlyView.Carbon‐based piezoelectric materials are systematically categorized based on their structural and functional properties. The mechanisms of stress‐induced charge transfer are elucidated, and their applications are explored across three key domains: piezoelectric catalysis for energy conversion and environmental remediation, piezoelectric biomedical ...
Mude Zhu +3 more
wiley +1 more source
Materials Advances in Devices for Heart Disease Interventions
Advanced Materials, EarlyView.This review examines the crucial role of materials in heart disease interventions, focusing on strategies for monitoring, managing, and repairing heart conditions. It discusses the material requirements for medical devices, highlighting recent innovations and their impact on cardiovascular health.
Gagan K. Jalandhra +11 more
wiley +1 more source
A shortest path routing problem with resource allocation
, 1987 Giorgio Pederzoli, N. G. F. Sancho
openalex +1 more source
Parameterized Complexity of Finding Dissimilar Shortest Paths [PDF]
arXivWe consider the problem of finding ``dissimilar'' $k$ shortest paths from $s$ to $t$ in an edge-weighted directed graph $D$, where the dissimilarity is measured by the minimum pairwise Hamming distances between these paths. More formally, given an edge-weighted directed graph $D = (V, A)$, two specified vertices $s, t \in V$, and integers $d, k$, the ...
arxiv
In Situ Manipulation of Growth Mechanisms in the Vapor–Solid–Solid Growth of GaP Nanowires
Advanced Materials Interfaces, EarlyView.The direct observation of the Ni‐assisted GaP nanowire growth process via transmission electron microscopy reveals two different growth mechanisms by Trimethylgallium (TMGa) precursor supply variations. The decrease of TMGa flow results in the formation of Ni2P phase as growth promoters with cation exchange reaction in addition to interface diffusion ...
Tianyi Hu +6 more
wiley +1 more source
The shortest path problem in the stochastic networks with unstable topology. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter [PDF]
arXivIn this paper, we study the computation of shortest paths within the \emph{geometric amoebot model}, a commonly used model for programmable matter. Shortest paths are essential for various tasks and therefore have been heavily investigated in many different contexts.
arxiv