As part of the ongoing effort in creating a parallel benchmark suite for C 3 I (command, control, communication, and intelligence) applications, we implemented an important C 3 I application, the decision support systems (DSS), using a genetic algorithmic approach. In this paper, we present the stru
A parallel solution to the HIP game based on genetic algorithms
โ Scribed by Tatiana Tambouratzis
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 142 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
โฆ Synopsis
In this piece of research, genetic algorithms are put forward for solving the HIP game. The proposed parallel approach manipulates candidate solutions via mutation and selection; no crossover has been employed. The population is limited to one candidate solution per generation, thus keeping the computational complexity of the approach to a minimum. It is shown that the proposed approach is superior to the approaches reported in the literature: Solutions are more speedily provided, whereas the frequency of finding a solution is significantly higher; furthermore, considerably more complex instances of the HIP game are successfully solved.
๐ SIMILAR VOLUMES
## Abstract In the framework of wireless communications, it is mandatory to guarantee the reliability of the receiver by assuring good quality at the endโuser, in order to successfully decode transmitted signals. To this end, a method for the design of adaptive antenna arrays is described in this p
## Abstract An improved smallโsignal model for a PHEMT (pseudomorphic highโelectronโmobility transistor) is presented in this paper. Both the extrinsic and intrinsic parameters of the smallโsignal model are determined using GA (genetic algorithm) optimization. First, parameter extraction of a small