Results 81 to 90 of about 6,540,973 (258)

The shortest path problem [PDF]

open access: yes, 2015
The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the i-dimensional space of ...
Baran, Andrzej
core   +1 more source

Emerging Post‐CMOS Hardware Neurons for Brain‐Inspired Computing: Devices, Circuits, and System Integration

open access: yesAdvanced Functional Materials, EarlyView.
The physical realization of artificial neurons is a critical challenge for energy‐efficient neuromorphic computing. This review presents a comprehensive analysis of the evolution of artificial neuron implementations from conventional CMOS to emerging post‐CMOS technologies.
Kannan Udaya Mohanan   +4 more
wiley   +1 more source

SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD

open access: yesJurnal Informatika, 2005
A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj  

Tracking Battery Microstructural Degradation Through Directional Thermal Transport Signatures

open access: yesAdvanced Functional Materials, EarlyView.
In lithium‐ion batteries, heat conduction varies between the through‐plane and in‐plane directions because of the cell's layered structure. Therefore, cell degradation influences thermal conductivity in each direction uniquely due to detailed microstructural and compositional changes.
Mohammad Shoghi Tekmedash   +6 more
wiley   +1 more source

Implementation of Circle-Breaking Algorithm on Fermatean Neutrosophic Graph to discover Shortest Path [PDF]

open access: yesNeutrosophic Sets and Systems
In many scientific domains, there is a growing interest in the shortest path problem. Traffic routes that can be precisely defined become arbitrary due to the damage that natural catastrophes inflict on roads and bridges.
S. krishna Prabha   +3 more
doaj   +1 more source

Core and Bargaining Set of Shortest Path Games [PDF]

open access: yes
In this paper it is shown that the core and the bargaining sets of Davis-Maschler and Zhou coincide in a class of shortest path games.Shortest path games; core; bargaining ...
Grahn, Sofia
core  

CO2‐to‐CO Conversion in a Gas‐Fed, Zero‐Gap, PEM Electrolyzer Enabled by Polycations and Nitrogen‐Doped Carbon‐Supported Cobalt Nanoparticles

open access: yesAdvanced Functional Materials, EarlyView.
A gas‐fed, zero‐gap, PEM CO2 electrolyzer is realized by incorporating PDDA+ ions onto the carbonaceous Co/N‐C electrocatalyst, with gaseous H2 and CO2 fed into the anode and cathode, respectively. Operating without an aqueous electrolyte, the system sustains a peak FECO of 65.1% at 100 mA cm−2. ABSTRACT Electrochemical carbon dioxide reduction (ECO2R)
Yuen Leong Chow   +6 more
wiley   +1 more source

An Efficient Algorithm for Touring n Circles

open access: yesMATEC Web of Conferences, 2018
This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting circle sequences in the plane. The problem is transformed to a corresponding problem of computing the shortest path of three disjoint circles.
Ding Yuepeng, Xie Xiong, Jiang Bo
doaj   +1 more source

Physics‐Grounded Materials Artificial Intelligence for Reliable Materials Discovery

open access: yesAdvanced Functional Materials, EarlyView.
Physics‐Grounded Materials AI (PhysMat AI) integrates physical priors, descriptors, constraints, verification, and data infrastructure into a unified full‐stack framework, enabling reliable, interpretable, and autonomous AI‐driven materials discovery.
Yuhang Wang   +3 more
wiley   +1 more source

Maximal buttonings of trees

open access: yesDiscussiones Mathematicae Graph Theory, 2014
A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1 ...
Short Ian
doaj   +1 more source

Home - About - Disclaimer - Privacy