Results 51 to 60 of about 286,038 (288)
INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]
The shortest path problem is widely applied in transportation, communication and computer networks. It addresses the challenges of determining a path with minimum distance, time or cost from a source to the destination.
S. Behzadi, M. Kolbadinejad
doaj +1 more source
Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading
The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley +1 more source
When the path is never shortest: a reality check on shortest path biocomputation
Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route ...
A Adamatzky +28 more
core +1 more source
In this work, a magnetic core‐shell catalyst (HOF‐on‐Fe3O4/ZIF‐67) is successfully synthesized, consisting of a metal–organic framework (ZIF‐67) with magnetic Fe3O4 as the core and a porous hydrogen‐bonded organic framework (HOF) as the shell. The catalyst efficiently activated peroxymonosulfate, resulting in rapid and effective removal of water ...
Yingying Du +4 more
wiley +1 more source
Comparison Analysis of Graph Theory Algorithms for Shortest Path Problem
The Sumba region, Indonesia, is known for its extraordinary natural beauty and unique cultural richness. There are 19 interesting tourist attractions spread throughout the area, but tourists often face difficulties in planning efficient visiting routes ...
Yosefina Finsensia Riti +2 more
doaj +1 more source
Speeding up shortest path algorithms
Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg +10 more
core +1 more source
Multiple Source Replacement Path Problem
One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph $G$, $s$ and $t$, find shortest paths from $s$ to $t$ avoiding each edge $e$ on the shortest path from $s$ to $t$.
Bernstein Aaron +8 more
core +1 more source
ASSOCIATIVE SHORTEST AND LONGEST PATH PROBLEMS [PDF]
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
Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana +2 more
wiley +1 more source
RUTE TERPENDEK UNTUK PENGANGKUTAN SAMPAH DENGAN PENDEKATAN LINTASAN HAMILTON
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

