Results 41 to 50 of about 32,209 (302)
Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
Моделирование и анализ информационных систем, 2013 The paper proposes an efficient associative algorithm for dynamic update of the shortest paths tree of a directed weighted graph after deleting an edge.
A. S. Nepomniaschaya
doaj +3 more sources
A genetic algorithm for finding the k shortest paths in a network
Egyptian Informatics Journal, 2010 Most of the multimedia applications require the k shortest paths during the communication between a single source and multiple destinations. This problem is known as multimedia multicast routing and has been proved to be NP-complete. The paper proposes a
Ahmed Younes Hamed
doaj +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Vervet monkey (Chlorocebus pygerythrus) behavior in a multi-destination route: Evidence for planning ahead when heuristics fail. [PDF]
PLoS ONE, 2018 Animal paths are analogous to intractable mathematical problems like the Traveling Salesman Problem (TSP) and the shortest path problem (SPP). Both the TSP and SPP require an individual to find the shortest path through multiple targets but the TSP ...
Julie Annette Teichroeb +1 more
doaj +1 more source
FEBS Letters, EarlyView.Inositol pyrophosphates are energy‐rich signaling molecules that perform critical functions in cells. Three different families of phosphatases hydrolyze the β phosphate of the inositol pyrophosphate molecules: two have narrow specificities and one is promiscuous.
Ronda J. Rolfes
wiley +1 more source
A Constrained Time-Dependent K Shortest Paths Algorithm Addressing Overlap and Travel Time Deviation
International Journal of Transportation Science and Technology, 2015 Theoretical research often assumes all users are homogeneous in their route choice decision and will always pick the route with the shortest travel cost, which is not necessarily the case in reality. This paper documents the research effort in developing
Xianbiao Hu, PhD, Yi-Chang Chiu
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Evaluation of Shortest Paths in Road Network [PDF]
Pakistan Journal of Commerce and Social Sciences, 2009 Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based ...
Farrukh Shehzad, Muhammad Akbar Ali Shah
doaj
Cybergeo, 2007 The quantitative study of an infrastructure network in geography often consists in assessing indicators on the network components (nodes and sections). In that respect, the network is modelled by a graph whose vertices and edges respectively correspond ...
Jean-François Gleyze
doaj +1 more source
Intrinsic Correlation with Betweenness Centrality and Distribution of Shortest Paths
Mathematics, 2022 Betweenness centrality evaluates the importance of nodes and edges in networks and is one of the most pivotal indices in complex network analysis; for example, it is widely used in centrality ordering, failure cascading modeling, and path planning ...
Yelai Feng +3 more
doaj +1 more source