Results 41 to 50 of about 6,540,973 (258)
Geometric organization and inference of shortest path nodes in soft random geometric graphs
Physical Review ResearchThe 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 +4 more
doaj +1 more source
IEEE AccessPathfinding 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 +4 more
doaj +1 more source
Membrane composition and thermodynamic identity as boundaries of life for synthetic cell research
FEBS Letters, EarlyView.What makes a cell a cell? The boundary of a living cell is not just a wall. Read as a Markov blanket, the membrane separates internal from external states, generating identity and non‐equilibrium order. Can this identity be rebuilt from scratch in a synthetic cell?
Caterina Presutti, Bert Poolman
wiley +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
Time-dependent stochastic shortest path(s) algorithms for a scheduled transportation network [PDF]
, 2005 Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms.
Wu, Q, Al-Dabass, D, Hartley, JK
core
Computer simulations of path generation and path form modification with rules working on a parallel cell-based architecture [PDF]
, 1994 Dautenhahn K, Cruse H. Computer simulations of path generation and path form modification with rules working on a parallel cell-based architecture. Computers Math. Applic.
Dautenhahn, Kerstin +3 more
core +1 more source
On solving the quadratic shortest path problem [PDF]
, 2020 The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized.
Sotirov, Renata +2 more
core +1 more source
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
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
Optimal Allocation of Protective Resources in Shortest-Path Networks [PDF]
, 2008 We develop a game theoretic approach for allocating protection resources among the components of a network so as to maximize its robustness to external disruptions.
Cappanera, Paola, Scaparra, Maria Paola
core