Results 61 to 70 of about 280,639 (334)

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

Near-Linear Query Complexity for Graph Inference

open access: yes, 2015
How efficiently can we find an unknown graph using distance or shortest path queries between its vertices? Let $G = (V,E)$ be an unweighted, connected graph of bounded degree.
Kannan, Sampath   +2 more
core   +1 more source

Mechanical Behavior and Microstructural Changes Associated with Tensile Deformation above the Martensite Start Temperature during Quenching and Subsequent Partitioning of a Low‐Alloy 37SiB6 Steel

open access: yesAdvanced Engineering Materials, EarlyView.
A new experimental setup, incorporating digital image correlation and infrared thermography in combination with inductive‐conductive heating for precise temperature control, is used to analyze the mechanical behavior and microstructural changes of sheet metal under complex thermomechanical test conditions that represent quench and partitioning ...
Christian Illgen   +4 more
wiley   +1 more source

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

Investigation of Oxide Dispersion Strengthening Effect on the Strength of Diffusion‐Bonded AISI304 Parts

open access: yesAdvanced Engineering Materials, EarlyView.
Experiments for reinforcing the diffusion bonding plane by the oxide dispersion strengthening effect are presented. Small ceramic particles (0.5 and 50 μm, respectively) are incorporated. Furthermore, ceramic particles help to penetrate stable passivation layers, enabling atomic diffusion across bonding planes. Since a ceramic–metallic interface cannot
Thomas Gietzelt   +4 more
wiley   +1 more source

An Optimal Path-Finding Algorithm in Smart Cities by Considering Traffic Congestion and Air Pollution

open access: yesIEEE Access, 2022
Finding the shortest and cleanest path in the cities is vital, especially in metropolises. Although several algorithms and some software have been introduced to manage the traffic or suggest a path with minimum traffic congestion, none considers air ...
Elham Ghaffari   +3 more
doaj   +1 more source

A Comprehensive Review of Additive Manufacturing for Space Applications: Materials, Advances, Challenges, and Future Directions

open access: yesAdvanced Engineering Materials, EarlyView.
Additive manufacturing (AM) transforms space hardware by enabling lightweight, high‐performance, and on‐demand production. This review outlines AM processes—powder bed fusion (PBF), directed energy deposition (DED), binder jetting (BJ), sheet lamination (SL), and material extrusion (ME)—applied to propulsion, satellite structures, and thermal devices ...
Stelios K. Georgantzinos   +8 more
wiley   +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  

Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems

open access: yes, 2007
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy.
Bauer, Reinhard   +2 more
openaire   +4 more sources

On the complexity of the shortest-path broadcast problem

open access: yesDiscrete Applied Mathematics, 2016
We study the shortest-path broadcast problem in graphs and digraphs, where a message has to be transmitted from a source node s to all the nodes along shortest paths, in the classical telephone model. For both graphs and digraphs, we show that the problem is equivalent to the broadcast problem in layered directed graphs.
CRESCENZI, PIERLUIGI   +6 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy