Results 91 to 100 of about 6,540,973 (258)
Maximum probability shortest path problem
, 2015 International audienceThe maximum probability shortest path problem involves the constrained shortest path problem in a given graph where the arcs resources are independent normally distributed random variables.
Cheng, Jianqiang, Lisser, Abdel
core +1 more source
Advanced Functional Materials, EarlyView.Advanced ink systems for solution‐processed textile triboelectric nanogenerators are systematically summarized, spanning conductive, tribo‐negative, and tribo‐positive layers. By connecting ink chemistry, deposition methods, and device function, the present review reveals the key governing principles of solution development and highlights practical ...
Xinlong Sun, Stephen Beeby
wiley +1 more source
Solving the Robust Shortest Path Problem with Multimodal Transportation
MathematicsThis paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can ...
Jinzuo Guo +3 more
doaj +1 more source
A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT [PDF]
ICTACT Journal on Soft Computing, 2010 This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node.
A. Nagoorgani, A. Mumtaj Begam
doaj
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
Bidirectional A*: comparing balanced and symmetric heuristic methods [PDF]
A widely known algorithm for ¯nding the shortest path in a network is Bidirectional A*. The version of bidirectional A* that is considered the most appropriatehitherto, uses so-called balanced heuristic estimates.
Post, H., Pijls, W.H.L.M.
core
Multiobjective shortest path problem with interval costs
, 2023 The multiobjective shortest path problem with interval costs is a gener- alization of the single-pair shortest path problem. In this problem, the edge weights are represented as tuples of intervals.
Březina, Jiří
core
Advanced Functional Materials, EarlyView.This review establishes structure‐property‐mechanism relationships across six modification strategies for V‐based oxide water‐splitting electrocatalysts: lattice engineering, heteroatom doping, interface engineering, carbon‐based hybridization, morphology engineering, and surface reconstruction and pre‐catalyst design, where dissolution is reframed as ...
Youness El Issmaeli +4 more
wiley +1 more source
Yet another bidirectional algorithm for shortest paths [PDF]
For finding a shortest path in a network the bidirectional~A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes.
Post, H., Pijls, W.H.L.M.
core
How good (or bad) is shortest path routing in layered networks
, 2012 Shortest path routing is used throughout the Internet. If link costs accurately reflect real costs of installation and maintenance, and the total network cost is accurately modelled as the sum of link costs, shortest path routing can be expected to ...
Li, Fan +9 more
core +1 more source