Results 71 to 80 of about 6,540,973 (258)
A Multi‐Scale Machine Learning Framework for the Inverse Design of High Entropy Alloys
High‐entropy alloys offer vast potential for various applications, including electrocatalysis; however, their compositional complexity challenges conventional screening. We introduce an inverse‐design framework combining two neural networks to determine optimal compositions and reconstruct nanoparticle geometry from targeted properties and conventional
Mikael Takoutsin +14 more
wiley +1 more source
The 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
Historical Foundation and Practical Guideline for Ferroelectric Switching Kinetic Studies
The P and U pulses in the conventional PUND measurements are not identical because of the interplay between switching current and the measurement circuit components. This circuit effect can lead to a shift in polarization transients and misinterpreted physics in the switching kinetics.
Yi Liang, Pat Kezer, John T. Heron
wiley +1 more source
Advances in Sustainable and Wearable Textile Based Soft Robotics
This Review examines advances in wearable textile‐based soft robotics, focusing on sustainable materials, integrated sensing, and scalable actuation. It discusses manufacturing and system integration across healthcare, assistive robotics, prosthetics, and human–machine interfaces, and highlights key challenges in circular design, including life‐cycle ...
Zahir Abbas +6 more
wiley +1 more source
To 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
Distributed algorithms from arboreal ants for the shortest path problem. [PDF]
Garg S +3 more
europepmc +1 more source
Stochastic shortest path algorithm based on Lagrangian relaxation [PDF]
In VLSI circuit design, graph algorithms are widely used and graph structure can model many problems. As technology continues to scale into nanometer design, the effects of process variation become more crucial and design parameters also change.
Hwang, Leslie K.
core
A systematic review is conducted to assess the influence of electrode architecture across micro‐ to mesoscopic length scales on electron‐transfer pathways in electrocatalysis. We discuss the structure‐activity relationships in electrocatalytic applications, including resource recovery and environmental remediation, and provide cost‐effective, efficient
Manshu Zhao +6 more
wiley +1 more source
On the shortest path problem of uncertain random digraphs. [PDF]
Li H, Zhang K.
europepmc +1 more source
K shortest paths in stochastic time-dependent networks [PDF]
A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent.
Andersen, Kim Allan +2 more
core

