Results 61 to 70 of about 32,185 (303)

Cyclic Olefin Copolymers as Versatile Materials for Advanced Engineering Applications

open access: yesAdvanced Functional Materials, EarlyView.
Cyclic olefin copolymers (COCs) are presented as highly versatile materials combining tunable synthesis, excellent optical properties, and mechanical robustness. Their potential spans microfluidics, bioengineering, and advanced electronics, while emerging self‐healing and sustainable solutions highlight future opportunities.
Giulia Fredi   +3 more
wiley   +1 more source

Rapid Physarum Algorithm for shortest path problem

open access: yes, 2014
As shortest path (SP) problem has been one of the most fundamental network optimization problems for a long time, technologies for this problem are still being studied.
Zhang, Xiaoge   +5 more
core   +1 more source

RUTE TERPENDEK UNTUK PENGANGKUTAN SAMPAH DENGAN PENDEKATAN LINTASAN HAMILTON

open access: yesE-Jurnal Matematika, 2021
This research is related to the route of picking up the waste which done by janitors in housing complex of Aur Duri Indah Rt.14 Jambi considering the condition of that housing which have some crossroads, such that janitors take the same road twice which ...
SYAMSYIDA ROZI, CUT MULTAHADAH
doaj   +1 more source

Formation of Quasi‐Decoupling Interface on Li‐Metal Anodes in High Donor Electrolyte

open access: yesAdvanced Functional Materials, EarlyView.
Li‐metal anode (LMA) is stabilized by introducing Li2Te2 as an electrolyte additive for Li‐metal batteries. Upon contact with Li, Li2Te2 spontaneously converts to Li2Te, which electronically isolates Li from dimethyl sulfoxide due to its large bandgap and minimal Bader charge transfer.
Hyerim Kim   +9 more
wiley   +1 more source

Finding next-to-shortest paths in a graph

open access: yes, 2004
We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest $(u,v)$-path is a shortest $(u,v)$-path amongst $(u,v)$-paths with length strictly greater than the length of the shortest $(u,v)$-path.
Krasikov, I   +3 more
core   +1 more source

The Algorithm for Solving Shortest-Path Problems Based on Electrical Circuit Laws [PDF]

open access: yesMuṭāli̒āt-i Mudīriyyat-i Ṣan̒atī, 2011
Shortest-path problem is one of the well-known optimization problems that has been studied by many scientists in recent years. Applications of this problem such as transportation and communication are generally solved by Dijkstra's Algorithm (Labeling ...
Ali Khatami Firoozabadi   +2 more
doaj  

Fuzzy Shortest Path Problem Based on Level 𝜆-Triangular LR Fuzzy Numbers

open access: yesAdvances in Fuzzy Systems, 2012
In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention.
S. Elizabeth, L. Sujatha
doaj   +1 more source

Solution‐Processed Two‐Dimensional Indium Oxide on Sodium‐Embedded Alumina for Reconfigurable Optoelectronic Synaptic Transistors

open access: yesAdvanced Functional Materials, EarlyView.
Wafer‐scale two‐dimensioanl In2Se3 oxidized into InOx on sodium‐embedded beta‐alumina enables multifunctional reconfigurable electronics. Sodium ions accumulate within distinct spatial distribution under drain‐controlle and gate‐controlled operation. Drain‐control operation gives controllability of ultraviolet‐driven optoelectronic synaptic conductance
Jinhong Min   +13 more
wiley   +1 more source

Integrated Field‐Free SOT Domain‐Wall Synapses and MTJ Stochastic Neurons for Hardware Boltzmann Machines

open access: yesAdvanced Functional Materials, EarlyView.
Field‐free spin‐orbit torque domain‐wall synapses integrated with stochastic MTJ neurons enable compact hardware Boltzmann machines. Leveraging intrinsic stochasticity and multi‐level conductance, the system achieves efficient probabilistic learning with high accuracy, demonstrating a scalable spintronic platform for energy‐efficient edge AI.
Aijaz H. Lone   +8 more
wiley   +1 more source

An investigation of shortest paths algorithms [PDF]

open access: yes, 1987
In this work, we classify the shortest path problems, review all source algorithms and analyse the different implementations of single source algorithms using various list structures and labelling techniques.
Tabatabai, Bijan Oni, Tabatabai, B.O
core  

Home - About - Disclaimer - Privacy