Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr
A survey of parallel distributed genetic algorithms
✍ Scribed by Enrique Alba; José M. Troya
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 650 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1076-2787
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract One of the most commonly used means to characterize potential energy surfaces of reactions and chemical systems is the Hessian calculation, whose analytic evaluation is computationally and memory demanding. A new scalable distributed data analytic Hessian algorithm is presented. Feature
We develop and experiment with a new parallel algorithm to approximate the maximum weight cut in a weighted undirected graph. Our implementation starts with the recent (serial) algorithm of Goemans and Williamson for this problem. We consider several different versions of this algorithm, varying the
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 comp
## Abstract In this article, a novel microstrip grid array antenna is presented. For achieving a high gain and good impedance match, its structural parameters were optimized by a parallel genetic algorithm. A prototype antenna measures a gain of 18.3 dBi with an input return loss of −15.0 dB at its