Results 101 to 110 of about 32,185 (303)
Interval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem
Mathematics, 2016 The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly.
Arindam Dey, Anita Pal, Tandra Pal
doaj +1 more source
Advanced Materials, EarlyView.The field of polymer thermoelectrics is entering a new era, featuring breakthroughs in addressing the conventional performance disparity between p‐type and n‐type polymers, pioneering doping frontiers, and sophisticated decoupling strategies. This review explores innovations in molecular design and superior stabilities, bridging the gap from ...
Suhao Wang
wiley +1 more source
Lazy Shortest Path Computation In Dynamic Graphs
Computer Science, 2012 We address the problem of single-source shortest path computation in digraphs with non-negative edge weights subjected to frequent edge weight decreases such that only some shortest paths are requested in-between updates.
Daniel Aioanei
doaj +1 more source
Advanced Materials, EarlyView.Molecular doping of conjugated polymers is fundamentally constrained by thermodynamic phase behavior. This Perspective reframes doping efficiency and stability in terms of miscibility limits, binodals, and solvus boundaries, highlighting the role of effective interaction parameters and charge transfer.
Somayeh Kashani +10 more
wiley +1 more source
Advanced Materials, EarlyView.The perspective presents an integrated view of neuromorphic technologies, from device physics to real‐time applicability, while highlighting the necessity of full‐stack co‐optimization. By outlining practical hardware‐level strategies to exploit device behavior and mitigate non‐idealities, it shows pathways for building efficient, scalable, and ...
Kapil Bhardwaj +8 more
wiley +1 more source
ASSOCIATIVE SHORTEST AND LONGEST PATH PROBLEMS [PDF]
Bulletin of informatics and cybernetics, 1999 Summary: We consider a wide class of shortest path problems where the length of a path is defined through various associative binary operations. Solving a system of two interrelated recursive equations, we simultaneously find both shortest and longest path lengths. We show the existence and uniqueness of the solution of the system.
openaire +2 more sources
Leaftronics: Bio‐Fractal Scaffolds From Leaf Venation for Low‐Waste Electronics
Advanced Materials, EarlyView.“Leaftronics” transforms naturally evolved leaf venation into quasi‐fractal scaffolds for sustainable electronics. Polymer‐infiltrated leaf skeletons can be used to fabricate ultra‐smooth, reflow‐ and thin‐film‐compatible decomposable substrates, while making the same lignocellulose networks conducting results in flexible transparent electrodes.
Rakesh Rajendran Nair +3 more
wiley +1 more source
Finding the K shortest hyperpaths using reoptimization [PDF]
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan +2 more
core
Implementation and application of algorithms for shortest path problem
, 2023 Problem najkraćeg puta modelira se pomoću grafova, a svodi se na traženje podgrafa s najmanjom težinom. Dijeli se na četiri varijante: najkraći put od jednog početnog vrha do svih ostalih, od svih ostalih do jednog odredišnog, između jednog para vrhova ...
Udiljak, Karla
core +2 more sources
Why Is the Mechanism Underlying the Chiral‐Induced Selectivity Effect Still Challenging?
Advanced Materials, EarlyView.The chiral‐induced spin selectivity (CISS) effect is observed in many experimental configurations and for different materials. However, there are theoretical challenges in attempting to explain those results. A qualitative framework for explaining all the results is presented.
Ron Naaman, Yossi Paltiel
wiley +1 more source