𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scalable Parallel Genetic Algorithms

✍ Scribed by Wilson Rivera

Book ID
110303856
Publisher
Springer Netherlands
Year
2001
Tongue
English
Weight
108 KB
Volume
16
Category
Article
ISSN
0269-2821

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scalable parallel graph coloring algorit
Scalable parallel graph coloring algorithms
✍ Gebremedhin, Assefaw Hadish ;Manne, Fredrik πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 1 views
Scalable Parallel Algorithms for FPT Pro
Scalable Parallel Algorithms for FPT Problems
✍ Faisal N. Abu-Khzam; Michael A. Langston; Pushkar Shanbhag; Christopher T. Symon πŸ“‚ Article πŸ“… 2006 πŸ› Springer 🌐 English βš– 255 KB
Scalable Parallel Algorithms for Geometr
Scalable Parallel Algorithms for Geometric Pattern Recognition
✍ Laurence Boxer; Russ Miller; Andrew Rau-Chaplin πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 203 KB

This paper considers a variety of geometric pattern recognition problems on input sets of size n using a coarse grained multicomputer model consisting of p processors with 0(nΓ‚p) local memory each (i.e., 0(nΓ‚p) memory cells of 3(log n) bits apiece), where the processors are connected to an arbitrary

Fast and Scalable Parallel Algorithms fo
Fast and Scalable Parallel Algorithms for Knapsack-like Problems
✍ Afonso Ferreira; John Michael Robson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 403 KB

We present two new algorithms for searching in sorted X Ψ‰ Y Ψ‰ R Ψ‰ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n ‫؍‬ O(2 s/4 ), we obtain a