Search results for "A* algorithm"
showing 10 items of 2538 documents
Synthetic Genes for artificial ants. Diversity in ant colony optimization algorithms
2010
Inspired from the fact that the real world ants from within a colony are not clones (although they may look alike, they are different from one another), in this paper, the authors are presenting an adapted ant colony optimisation (ACO) algorithm that incorporates methods and ideas from genetic algorithms (GA). Following the first (introductory) section of the paper is presented the history and the state of the art, beginning with the stigmergy and genetic concepts and ending with the latest ACO algorithm variants as multiagent systems (MAS). The rationale and the approach sections are aiming at presenting the problems with current stigmergy-based algorithms and at proposing a (possible - ye…
On optimal deployment of low power nodes for high frequency next generation wireless systems
2018
Recent development of wireless communication systems and standards is characterized by constant increase of allocated spectrum resources. Since lower frequency ranges cannot provide sufficient amount of bandwidth, new bands are allocated at higher frequencies, for which operators resort to deploy more base stations to ensure the same coverage and to utilize more efficiently higher frequencies spectrum. Striving for deployment flexibility, mobile operators can consider deploying low power nodes that could be either small cells connected via the wired backhaul or relays that utilize the same spectrum and the wireless access technology. However, even though low power nodes provide a greater fl…
Implementation of algorithms forK shortest loopless paths
1986
Implementations of loopless k shortest path algorithms are examined. Efficient storage structures for a large number of paths are given. A fast algorithm for determining the shortest paths in Yen's method is developed. Timing experiments show that a hybrid of Clarke's and Yen's methods is generally the fastest, although not significantly. Using upper bounds for the lengths of paths essentially improves all methods.
Default effects in app selection: German adolescents’ tendency to adhere to privacy or social relatedness features in smartphone apps
2019
Cognitive biases such as default effects impact on user preferences for a broad range of different choices. This paper investigates these default effects among adolescents configuring apps that either satisfy relatedness or enhance autonomy by protecting privacy. Relatedness and privacy are two innate needs that adolescents can satisfy with the use of smartphone apps. This study argues that adolescents’ choice of features supporting either privacy protection or social relatedness is a consequence of default effects, so that adolescents adhere to preselected defaults. We test this assumption in an experimental survey design including four app configuration tasks with N = 280 German adolesce…
An optimized mass storage FFT for vector computers
1995
Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.
SAUCE: A web application for interactive teaching and learning of parallel programming
2017
Abstract Prevalent hardware trends towards parallel architectures and algorithms create a growing demand for graduate students familiar with the programming of concurrent software. However, learning parallel programming is challenging due to complex communication and memory access patterns as well as the avoidance of common pitfalls such as dead-locks and race conditions. Hence, the learning process has to be supported by adequate software solutions in order to enable future computer scientists and engineers to write robust and efficient code. This paper discusses a selection of well-known parallel algorithms based on C++11 threads, OpenMP, MPI, and CUDA that can be interactively embedded i…
A Predictive Approach for the Efficient Distribution of Agent-Based Systems on a Hybrid-Cloud
2018
International audience; Hybrid clouds are increasingly used to outsource non-critical applications to public clouds. However, the main challenge within such environments, is to ensure a cost-efficient distribution of the systems between the resources that are on/off premises. For Multi Agent Systems (MAS), this challenge is deepened due to irregular workload progress and intensive communication between the agents, which may result in high computing and data transfer costs. Thus, in this paper we propose a generic framework for adaptive cost-efficient deployment of MAS with a special focus on hybrid clouds. The framework is based mainly on the use of a performance evaluation process that con…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
On the Quantum and Classical Complexity of Solving Subtraction Games
2019
We study algorithms for solving Subtraction games, which are sometimes referred as one-heap Nim games.
Efficient Parallel Nash Genetic Algorithm for Solving Inverse Problems in Structural Engineering
2015
A parallel implementation of a game-theory based Nash Genetic Algorithm (Nash-GAs) is presented in this paper for solving reconstruction inverse problems in structural engineering. We compare it with the standard panmictic genetic algorithm in a HPC environment with up to eight processors. The procedure performance is evaluated on a fifty-five bar sized test case of discrete real cross-section types structural frame. Numerical results obtained on this application show a significant achieved increase of performance using the parallel Nash-GAs approach compared to the standard GAs or Parallel GAs.