Results 51 to 60 of about 22,360 (263)
On the Quadratic Shortest Path Problem [PDF]
, 2015 Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Rostami, Borzou +3 more
openaire +3 more sources
Electroactive Metal–Organic Frameworks for Electrocatalysis
Advanced Functional Materials, EarlyView.Electrocatalysis is crucial in sustainable energy conversion as it enables efficient chemical transformations. The review discusses how metal–organic frameworks can revolutionize this field by offering tailorable structures and active site tunability, enabling efficient and selective electrocatalytic processes.
Irena Senkovska +7 more
wiley +1 more source
Backbone Heterojunction Photocatalysts for Efficient Sacrificial Hydrogen Production
Advanced Functional Materials, EarlyView.Herein, a ‘single‐component’ organic semiconductor photocatalyst is presented in which a molecular donor is bonded to a polymer acceptor. The resultant material demonstrates exceptional photocatalytic activity for hydrogen evolution in aqueous triethylamine with an outstanding external quantum efficiency of 38% at 420 nm.
Richard J. Lyons +11 more
wiley +1 more source
MOFs and COFs in Electronics: Bridging the Gap between Intrinsic Properties and Measured Performance
Advanced Functional Materials, EarlyView.Metal‐organic frameworks (MOFs) and covalent organic frameworks (COFs) hold promise for advanced electronics. However, discrepancies in reported electrical conductivities highlight the importance of measurement methodologies. This review explores intrinsic charge transport mechanisms and extrinsic factors influencing performance, and critically ...
Jonas F. Pöhls, R. Thomas Weitz
wiley +1 more source
Random assignment and shortest path problems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by
Johan Wästlund
doaj +1 more source
Advanced Functional Materials, EarlyView.Lead halide perovskite nanocrystals are promising scintillators but suffer from reabsorption losses and limited compatibility with high‐Z additives. Hybridization of CsPbBr3 nanocrystals with PbBr2‐passivated HfO2 nanoparticle sensitizers, achieved during or after synthesis, produces stable composites with maintained optical quality, improved ...
Francesco Bruni +17 more
wiley +1 more source
Advanced Functional Materials, EarlyView.In this study, the preparation techniques for silver‐based gas diffusion electrodes used for the electrochemical reduction of carbon dioxide (eCO2R) are systematically reviewed and compared with respect to their scalability. In addition, physics‐based and data‐driven modeling approaches are discussed, and a perspective is given on how modeling can aid ...
Simon Emken +6 more
wiley +1 more source
MathematicsThe shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it often ...
Adrien Durand +3 more
doaj +1 more source
Advanced Functional Materials, EarlyView.An innovative medium entropy alloy (MEA) composite material was fabricated via micro laser powder bed fusion (μ‐LPBF) with appropriate nano‐ceramic particles doping and exhibited markedly improved overall performance, including synergistically enhanced strength and ductility, increased hardness and compressive strength, improved wear resistance and ...
Zhonglin Shen, Mingwang Fu
wiley +1 more source
Frontiers in NeuroroboticsTo reduce transportation time, a discrete zeroing neural network (DZNN) method is proposed to solve the shortest path planning problem with a single starting point and a single target point.
Feifan Song +3 more
doaj +1 more source