Results 291 to 300 of about 1,031,530 (335)
Integrating graph neural networks and LSTM for path optimization in smart port multi-modal systems. [PDF]
PLoS OneHe J, Chen W, Sun J, Zhu L.
europepmc +1 more source
Connectivity Labeling in Faulty Colored Graphs. [PDF]
Distrib ComputPetruschka A, Sapir S, Tzalik E.
europepmc +1 more source
Emotional interaction mechanism of intelligent educational robots in assisting language acquisition: an empirical study based on multimodal data in primary and secondary schools. [PDF]
BMC PsycholGao Y.
europepmc +1 more source
DateLine: Efficient Algorithm for Computing Region Disjoint Paths in Backbone Networks
Bérczi-Kovács, Erika +3 more
openalex +1 more source
Optimization of power grid material warehousing and supply chain distribution path planning based on improved PSO algorithm. [PDF]
Sci RepGe J +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computing shortest paths with uncertainty
Journal of Algorithms, 2003We consider the problem of estimating the length of the shortest path from a vertex s to a vertex t in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Initially, for each edge e, the length of e is known only to lie within an interval [l"e,h"e]; the estimation algorithm can pay w"e to find the exact length
Tomás Feder +4 more
openaire +1 more source
An algorithm to compute collusion paths
Proceedings of INFOCOM '97, 2002In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting from their initial knowledge, and have presented a complete solution for a special case of the problem.
Steven H. Low, Nicholas F. Maxemchuk
openaire +1 more source