✦ LIBER ✦

Parallel evolutionary algorithms can achieve super-linear performance

✍ Scribed by Enrique Alba

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 105 KB
Volume: 82
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00281-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance of parallel spanning tree al

Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems

✍ Sajal K. Das; Cui-Qing Yang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Das, S.K. and C-Q. Yang, Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems, Parallel Computing 17 (1991) 527-551. This paper presents empirical performance of parallel algorithms for connected graphs on the transputer and Unix systems, where processes

An experience with super-linear speedup

An experience with super-linear speedup achieved by parallel computing on a workstation cluster: Parallel calculation of density of states of large scale cyclic polyacenes

✍ Umpei Nagashima; Sachiko Hyugaji; Satoshi Sekiguchi; Mitsuhisa Sato; Haruo Hosoy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 902 KB

Comparison of performance of three paral

Comparison of performance of three parallel versions of the block cyclic reduction algorithm for solving linear elliptic partial differential equations

✍ Jung-Sing Jwo; S. Lakshmivarahan; Sudarshan K. Dhall; John M. Lewis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 973 KB