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.
Path-Finding algorithms mainly solve the problem of how to find a path from the starting point to the target point. If there is no connected path, the game will enter the deadlock state. This paper focuses on analyzing the rule of picture matching, giving the estimated formula and process of the A* algorithm in this game, and introducing a typical determining deadlock algorithm: the A* algorithm-based...
Thanks to the important and increasing growth of the carpooling phenomenon throughout the world, many researchers have particularly focused their efforts on this concept. Researches led to many systems affording carpooling service not usually effective. In fact, most of them present multiple drawbacks regarding automation, functionalities, accessibility, etc. Besides, only few researchers focused...
Finding and counting the occurrences of a collection of subgraphs within another larger network is a computationally hard problem, closely related to graph isomorphism. The subgraph count is by itself a very powerful characterization of a network and it is crucial for other important network measurements. G-tries are a specialized data-structure designed to store and search for subgraphs. By taking...
We describe an approach to parallel graph partitioning that scales to hundreds of processors and produces a high solution quality. For example, for many instances from Walshaw's benchmark collection we improve the best known partitioning. We use the well known framework of multi-level graph partitioning. All components are implemented by scalable parallel algorithms. Quality improvements compared...
We present a new approach for parallel massive graph analysis of streaming, temporal data with a dynamic and extensible representation. Handling the constant stream of new data from health care, security, business, and social network applications requires new algorithms and data structures. We examine data structure and algorithm trade-offs that extract the parallelism necessary for high-performance...
The single-source shortest path problem based on the road network has many obvious geographic spatial characteristics. By designing the spatial data model of the road network and analyzing the geometric characteristic of the spatial trend of the path we form a spatial restricted function which can reduce the cost of searching the shortest path in the road network. The spatial restricted function is...
This paper presents an in-depth analysis of characterization for an irregular application - computing betweenness centrality (BC) - on multicore architectures. BC algorithm is widely used in large scale graph analysis applications, which play an increasingly important role in high performance computing community. Through a joint study of architecture and application, we find that dynamically non-contiguous...
With the research and application of intelligent transportation system, there is a higher requirement for solving the optimal path problem in large scale transportation networks in real time. In order to get the effective optimal path algorithms for the actual transportation networks, three optimal path algorithms are chosen to be parallelized. The parallel optimal path algorithms are then implemented...
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socio-economic interactions, social networking Web sites, communication traffic, and scientific computing can be intuitively modeled as graphs. We present the first study of novel high-performance combinatorial techniques for analyzing largescale information networks, encapsulating dynamic interaction...
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.