✦ LIBER ✦

Implicit parallelism in genetic algorithms

✍ Scribed by Alberto Bertoni; Marco Dorigo

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 318 KB
Volume: 61
Category: Article
ISSN: 0004-3702
DOI: 10.1016/0004-3702(93)90071-i

No coin nor oath required. For personal study only.

✦ Synopsis

Bertoni, A. and M. Dorigo, Implicit parallelism in genetic algorithms (Research Note), Artificial Intelligence 61 (1993) 307-314. This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of n3/c,VTl to the number of schemata usefully processed by the genetic algorithm in a population of n = c 1 • 2 ~ binary strings, with c, a small integer. We analyze the case of a population of n = 2 ~' binary strings where/3 is a positive parameter (Holland's result is related to the case/3 = 1). In the main result, we state a lower bound on the expected number of processed schemata for all /3 > 0; moreover, we prove that this bound is tight up to a constant for all 18 ~> 1 and, in this case, we strengthen in probability the previous result.

📜 SIMILAR VOLUMES

Automatically exploiting implicit parall

Automatically exploiting implicit parallelism in Java

✍ Bik, Aart J. C.; Gannon, Dennis B. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB 👁 2 views

In this paper we show how implicit parallelism in Java programs can be made explicit by a restructuring compiler using the multi-threading mechanism of the language. In particular, we focus on automatically exploiting implicit parallelism in loops and multi-way recursive methods. Expressing parallel

Parallel versions of Stone's strongly im

Parallel versions of Stone's strongly implicit algorithm

✍ J. S. Reeve; A. D. Scurr; J. H. Merlin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 352 KB

## Abstract In this paper, we describe various methods of deriving a parallel version of Stone's Strongly Implicit Procedure (SIP) for solving sparse linear equations arising from finite difference approximation to partial differential equations (PDEs). Sequential versions of this algorithm have be

Heterogeneous Computing and Parallel Gen

Heterogeneous Computing and Parallel Genetic Algorithms

✍ Enrique Alba; Antonio J. Nebro; José M. Troya 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 495 KB

This paper analyzes some technical and practical issues concerning the heterogeneous execution of parallel genetic algorithms (PGAs). In order to cope with a plethora of different operating systems, security restrictions, and other problems associated to multi-platform execution, we use Java to impl

A survey of parallel distributed genetic

A survey of parallel distributed genetic algorithms

✍ Enrique Alba; José M. Troya 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 650 KB

Optimization Algorithms in Physics || Ge

Optimization Algorithms in Physics || Genetic Algorithms

✍ Hartmann, Alexander H.; Rieger, Heiko 📂 Article 📅 2001 🏛 Wiley-VCH Verlag GmbH & Co. KGaA ⚖ 938 KB

The iterative group implicit algorithm f

The iterative group implicit algorithm for parallel transient finite element analysis

✍ Sukomal Modak; Elisa D. Sotelino 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

The Iterative Group Implicit (IGI) algorithm is developed for the parallel solution of general structural dynamic problems. In this method the original structure is partitioned into a number of a subdomains. Each subdomain is solved independently and therefore concurrently, using any traditional dir