Results 41 to 50 of about 5,425,704 (264)

Path Selection for Quantum Repeater Networks

, 2012
Quantum networks will support long-distance quantum key distribution (QKD) and distributed quantum computation, and are an active area of both experimental and theoretical research.
A Basu, A Fedrizzi, A G Fowler, A K Ekert, A Medina, A Mink, C Elliott, C Franco Di, C H Bennett, C H Bennett, C-W Chou, D Copsey, D Dodson, E D’Hondt, E W Dijkstra, H Buhrman, H J Kimble, H-J Briegel, H-K Lo, J D Touch, J Dehaene, J Moy, L Childress, L Hartmann, L Jiang, L Jiang, M Ben-Or, M Oskin, M Peev, N Isailovic, P Loock van, P Villoresi, R Alléaume, R Govindan, R Meter Van, R Meter Van, R Reichle, S Bratzik, S Lloyd, S Nagayama, S Tani, T D Ladd, T S Metodi, T Scheidl, T Tashima, T-Y Chen, W Dür, W J Munro, W J Munro, W K Wootters, Z Zhao   +50 more
core   +1 more source

Rapid path planning algorithm for mobile robot in dynamic environment

Advances in Mechanical Engineering, 2017
Searching the lowest-cost path through a graph is central to many problems, including path planning for a mobile robot. By combining Dijkstra’s algorithm, A* algorithm, and rolling window principle, a new rapid path planning algorithm for a mobile robot ...
Hong-mei Zhang, Ming-long Li
doaj   +1 more source

An Efficient Multi-objective Approach for Designing of Communication Interfaces in Smart Grids [PDF]

, 2016
The next generation of power systems require to use smart grid technologies due to their unique features like high speed, reliable and secure data communications to monitor, control and protect system effectively.
Anvari-Moghaddam, Amjad, Bak-Jensen, Birgitte, Ghasemkhani, Amir, Guerrero, Josep M.   +3 more
core   +2 more sources

NNIR: N-Non-Intersecting-Routing Algorithm for Multi-Path Resilient Routing in Telecommunications Applications

International Journal of Computational Intelligence Systems, 2020
In this paper, we will present a N-Non-Intersecting-Routing (NNIR) algorithm which is used to reduce the cost of resilient routing in telecommunications problems.
Lewis Veryard, Hani Hagras, Andrew Starkey, Anthony Conway, Gilbert Owusu   +4 more
doaj   +1 more source

Explanation and Speedup Comparison of Advanced Path-planning Algorithms Presented on Two-dimensional Grid

Mendel, 2022
Path planning or network route planning problems are an important issue in AI, robotics, or computer games. Appropriate implementation and knowledge of advanced and classical path-planning algorithms can be important for both autonomous navigation ...
Petr Soustek, Radomil Matousek, Jiri Dvorak, Lenka Manakova   +3 more
doaj   +1 more source

Automating AI Discovery for Biomedicine Through Knowledge Graphs and Large Language Models Agents

Advanced Intelligent Discovery, EarlyView.
This work proposes a novel framework that automates biomedical discovery by integrating knowledge graphs with multiagent large language models. A biologically aligned graph exploration strategy identifies hidden pathways between biomedical entities, and specialized agents use this pathway to iteratively design AI predictors and wet‐lab validation ...
Naafey Aamer, Muhammad Nabeel Asim, Shan Munir, Andreas Dengel   +3 more
wiley   +1 more source

Low Cost Quality of Service Multicast Routing in High Speed Networks [PDF]

, 1997
Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or ...
Crawford, John, Waters, A. Gill
core   +1 more source

Finding the Best QoS Path in a Gilbert Channel Network [PDF]

, 2008
Many different types of modern wired and wireless communication links can be mathematically described as discrete- time Gilbert channels. In this extended abstract, we present an exact method of calculating the best path in a network of discrete- time ...
Soedarmadji, Edwin
core   +2 more sources

Optimal distribution of vehicular traffic flow with Dijkstra’s algorithm and Markov chains

African Scientific Reports
The optimization of traffic distribution is a critical problem in transportation networks, where efficient routing can reduce congestion, minimize travel time, and improve overall traffic flow.
L. I. Igbinosun, N. R. Udoenoh
doaj   +1 more source

THE USE OF THE ROADLOAD APPLICATION IN GEOGRAPHICAL STUDIES OF FLOWS GENERATED BY INDIVIDUAL MODES OF TRANSPORT [PDF]

Transport Problems, 2020
The purpose of this article is to present the authors' own software for predicting changes in the density and directions of traffic flows and to compare overall results of research on transport accessibility with the ...
Marta BOROWSKA-STEFAŃSKA, Michał KOWALSKI, Szymon WIŚNIEWSKI, Adam DOMAGALSKI   +3 more
doaj   +1 more source