Results 21 to 30 of about 16,261 (217)
Building graph-based programming strategies for reconfigurable photonic circuits [PDF]
, 2019 We have developed a graph representation of programmable photonic mesh circuits that can be used by pathfinding algorithms. We modified the Dijkstra algorithm to observe only physically possible connections in the graph, demonstrating flexible rerouting ...
Bogaerts, Wim, Chen, Xiangfeng
core +1 more source
Calculating the Shortest Path Using Dijkstra’s Algorithm
Araştırma Temelli Etkinlik Dergisi, 2018 The Dijkstra's algorithm is an algorithm that determines the shortest paths needed to go from a starting node to any node in a graph. In this article, the process and results of an activity that included route formation among the provinces in the Aegean ...
Bekir Cevizci
doaj +4 more sources
IJAIT (International Journal of Applied Information Technology)Artificial intelligence in a game plays a vital role in enhancing the player's gaming experience, especially in single-player games. NPCs are the primary means of interaction in single-player games, assisting and guiding players like interactions with ...
Dany Zaky Dhaifullah +2 more
doaj +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
The boolean map distance: theory and efficient computation [PDF]
, 2017 We propose a novel distance function, the boolean map distance (BMD), that defines the distance between two elements in an image based on the probability that they belong to different components after thresholding the image by a randomly selected ...
Malmberg, Filip +3 more
core +1 more source
Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties
Algorithms, 2020 In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to
Rhyd Lewis
doaj +1 more source
Defining Equitable Geographic Districts in Road Networks via Stable Matching
, 2017 We introduce a novel method for defining geographic districts in road networks using stable matching. In this approach, each geographic district is defined in terms of a center, which identifies a location of interest, such as a post office or polling ...
Eppstein, David +3 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
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 School is an essential thing for education quality. This time, the South Tangerang government is implementing a new student admission process using a zoning system; all prospective students must choose a school that has the shortest distance from their ...
Maulana Muhamad Sulaiman, Sahlan Sahlan
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 +3 more
doaj +1 more source