Results 41 to 50 of about 23,111 (264)

Geometric organization and inference of shortest path nodes in soft random geometric graphs

Physical Review Research
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks.
Zhihao Qiu, Sámuel G. Balogh, Xinhan Liu, Piet Van Mieghem, Maksim Kitsak   +4 more
doaj   +1 more source

Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search

IEEE Access
Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions ...
Amr Elshahed, Majid Khan Bin Majahar Ali, Ahmad Sufril Azlan Mohamed, Farah Aini Binti Abdullah, Ts. Lee Jian Aun   +4 more
doaj   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Protocol for quantifying miRNA trafficking across the endosomal membrane

FEBS Open Bio, EarlyView.
An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh, Kamalika Mukherjee, Suvendra N. Bhattacharyya   +2 more
wiley   +1 more source

The Application of Floyd Algorithm for Returning Path Algorithm with Constraints of Time and Limit of Load

MATEC Web of Conferences, 2016
Under ideal condition, there are lots of Shortest Path Algorithms such as Dijkstra, Floyd, Johnson algorithms. However, putting these algorithms into use is not as we expected.
Luo Jian Feng, Chen Yu Qiang
doaj   +1 more source

A fast layered path planning algorithm for job shop scheduling problem

IET Collaborative Intelligent Manufacturing, 2022
Job shop scheduling problem (JSP) is a classical system resource optimisation problem and also an NP hard problem. The search algorithm based on Akers obstacle graph model is an effective algorithm to solve JSP, which first removes part of jobs from the ...
Lin Huang, Shikui Zhao, Qing Han
doaj   +1 more source

High Health Care Utilization Preceding Diagnosis With Juvenile Idiopathic Arthritis

Arthritis Care &Research, EarlyView.
Objective Although early diagnosis improves long‐term outcomes, patients with juvenile idiopathic arthritis (JIA) often experience prolonged, circuitous paths to diagnosis. To inform diagnostic improvement, we sought to characterize health care utilization in the year preceding diagnosis. Methods We identified 10,021 patients with an incident diagnosis
Anna Costello, Rui Xiao, Xuemei Zhang, Jahan Jazayeri, Irit R. Rasooly, Pamela F. Weiss   +5 more
wiley   +1 more source

Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading

Advanced Engineering Materials, EarlyView.
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

Fostering Innovation: Streamlining Magnetocaloric Materials Research by Digitalization

Advanced Engineering Materials, EarlyView.
Magnetocaloric cooling (MCE) is an environmentally friendly refrigeration method with great potential. Optimizing MCE materials involves the preparation and screening of large quantities of samples, which in turn generates a large amount of data. A digitalization approach is presented that uses ontologies, knowledge graphs, and digital workflows to ...
Simon Bekemeier, Moritz Blum, Luana Caron, Alisa Chirkova, Philipp Cimiano, Basil Ell, Inga Ennen, Michael Feige, Maik Gaerner, Thomas Hilbig, Andreas Hütten, Günter Reiss, Tapas Samanta, Sonja Schöning, Christian Schröder, Lennart Schwan, Chris Taake, Martin Wortmann   +17 more
wiley   +1 more source

INTRODUCING A NOVEL METHOD TO SOLVE SHORTEST PATH PROBLEMS BASED ON STRUCTURE OF NETWORK USING GENETIC ALGORITHM [PDF]

The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2019
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