The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The shortest path algorithm is the core problems in intelligent transportation system (ITS), especially for the large scale networks. The problem is classically solved by Dijkstra and Floyed algorithm. Meanwhile, many techniques are proposed to improve the algorithms heuristically. In most researches, such techniques are considered individually. In this paper, we propose an improved shortest path...
Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications.This paper proposes a minimum spanning tree algorithm using Prim's approach on Nvidia GPU under CUDA architecture. By using new developed GPU-based Min-Reduction data parallel primitive in the key step of the algorithm, higher efficiency is achieved. Experimental results show that we...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.