Joachim Sprave. Parallelisierung Genetischer Algorithmen zur suche und optimierung. Master's thesis, University of Dortmund, Department of Computer Science, 1990. yUDO RA ga:SpraveMSThesis.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... [91, 393, 440] Conservatoire National des Artes et Metiers Centre Regional Associe de Grenoble, 373] Fernuniversit at Gesamthochschule in Hagen, 335] Helsinki University of Technology, 107] The Hebrew University of Jerusalem, 108] University of Alabama, 482] University of Dortmund, [410, 556, 497] University of Newcastle upon Tyne, 316] University of Tulsa, 431] University of Virginia, 414] Universit at Bonn, 460] Universit at Erlangen N urnberg, 105, 114, 128, 491] total 19 thesis in 12 schools Report series 13 4.4 Report series The following list contains references to all papers ....

....329] Slootmaekers, Romain, 346] Smith, A. 220] Smith, D. G. 473] Smith, George D. 101, 403] Sonza Reorda, Matteo, 239, 280, 283, 493] Soraghan, J. J. 175] Sowa, K. 233, 311] Spector, Lee, 527] Spiessens, Piet, 436, 494, 495, 496] Spillane, Andrew R. 380] Sprave, Joachim, [190, 417, 557, 497] Sribar, Aljo sa, 266, 296] Srivastava, A. 274] Stanley, Timothy J. 193] Starkweather, Timothy John, 517, 518, 59, 77, 519] State, L. 66] State, R. 66] Stender, Joachim, 498] Stinchcombe, J. 116, 145] Sto el, Kilian, 527] St oppler, S. 363] Stork, David G. 54] Stra s, ....

[Article contains additional citation context not shown here]

Joachim Sprave. Parallelisierung Genetischer Algorithmen zur suche und optimierung. Master's thesis, University of Dortmund, Department of Computer Science, 1990. yUDO RA ga:SpraveMSThesis.

....thesis in 8 schools 9 10 Genetic algorithms of 1990 4.3.2 Master s theses This list includes also Dimplomarbeit , Tech. Lic. Theses , etc. Eindhoven University of Technology, 287] Technische Universitat der Berlin, 85] University of California at San Diego, 107] University of Dortmund, [190, 254, 266, 277] University of Tennessee, 191] University of Virginia, 43] University of Wales, 207] Universitat Kaiserslautern, 148] Wayne State University, 114] total 12 thesis in 9 schools 4.4 Report series The following list contains references to all papers published as technical reports. The list ....

....[270, 271, 272] Shaner, Daniel, 299] Shu, Lingyan, 263] Sims, Karl, 273] Skolnick, Michael M. 236] Smith, Robert Elliot, 122] Smith, Terence R. 233] Spackman, Kent A. 209] Spears, William M. 71, 274] Spiessens, Piet, 275, 276] Spofford, J. J. 150] Sprave, Joachim, [277] Stanley, D. A. 168] Starkweather, Timothy John, 295, 297, 298, 299] Stender, Joachim, 278] Stoll, Kenneth E. 293] Stork, David G. 279, 12] Sugai, Y. 151] Suh, Jung Y. 46] Sumida, Brian H. 142] Syswerda, Gilbert, 280] Taylor, Charles, 164] Taylor, David, 21] Thierens, ....

[Article contains additional citation context not shown here]

Joachim Sprave. Parallelisierung Genetischer Algorithmen zur suche und optimierung. Master's thesis, University of Dortmund, Department of Computer Science, 1990. y(UDO RA) ga:SpraveMSThesis.

.... Universit at der Berlin, 82, 91, 108, 118, 131, 133, 138, 143] The Hebrew University of Jerusalem, 22] The University of Alabama, 30] University of Alabama, 77, 125, 129] University of British Columbia, 84, 104] University of California at San Diego, 87] University of Dortmund, [70, 79, 92, 102, 105, 111, 116, 121, 128, 132, 137, 141, 144, 145] University of East Anglia, 100] University of Edinburgh, 31, 38, 41, 85] University of Erlangen and The University of Tennessee, 19] University of Exeter, 109] University of Genova , 13] University of Helsinki, 49, 53, 64] University of Idaho, 88, 96] University of Illinois at ....

....Sekharan, D. Ansa, 134] Self, Steven, 135] Semertzidis, Michael T. 171] Sen, Sandip, 129] Seniw, D. 369] Shu, Lingyan, 330] Shyu, Ming Suen, 39] Siegmund, Frederik, 136] Sittisathanchai, Sinchai, 172] Smith, Robert Elliot, 351, 125] Smith, Stephen F. 363] Sprave, Joachim, [137] Sputek, K. 138] Starkweather, Timothy John, 370] Stevens, J. 139] Swaminathan, R. 30] Syed, Omar, 40] Tackett, Walter Alden, 187] Tadikonda, Satish Kumar, 372] Talbi, El Ghazali, 373] Tanese, Reiko, 374] Taylor, Timothy John, 254] Thangiah, Sam Rabindranath, 375] ....

[Article contains additional citation context not shown here]

Joachim Sprave. Parallelisierung Genetischer Algorithmen zur suche und optimierung. Master's thesis, University of Dortmund, Department of Computer Science, 1990. yUDO RA ga:SpraveMSThesis.

....important for a good algorithmic performance. Moreover, numerical results seem to indicate that algorithms using the diffusion model perform better on average. So it would be interesting for practical reasons to simulate the SIMD algorithm on a MIMD machine. First experimental results are given by [48], who implemented a parallel GA in such a manner on a transputer system with 30 transputers in order to solve combinatorial problems. In order to continue this work we have implemented a parallel ES of this kind and applied it to global optimization problems. Figure 1 is intended to illustrate how ....

J. Sprave. Parallelisierung Genetischer Algorithmen zur Suche und Optimierung. Master 's thesis, University of Dortmund, Chair of System Analysis, December 1990.

....Gorges Schleuter, and Kramer (1988) and appeared later under terms like plant pollination model (Goldberg 1989) parallel individual model (Hoffmeister 1991) or diffusion model. The first implementations of the model onto a parallel machine has been conducted by Gorges Schleuter (1989) Sprave (1990), Palmer and Smith (1991) and Spiessens and Manderick (1991) whereas Manderick and Spiessens (1989) tested a simulation on a uniprocessor machine. All these implementations have been developed for genetic algorithms in order to solve combinatorial or pseudoboolean optimization problems. The first ....

....optimization problems. The first usage of this model in the context of optimization over continuous variables appeared in Rudolph (1992) In most cases the spatial structure of the population was adapted to the processor communication network of the underlying parallel machine. As demonstrated in Sprave (1990) it is useful to design algorithms of the above type for SIMD type parallel computers, because these algorithm can be mapped onto MIMD type computers easily. Therefore, the most usual spatial population structures are meshes or toroids. 4.2 Design of the neighborhood algorithm Here, the ....

Sprave, J. (1990). Parallelisierung Genetischer Algorithmen zur Suche und Optimierung.

....each process consists of a complete evolutionary algorithm. On the contrary, coarse grained parallel machines with a small number of powerful processors allow to emulate a fine grained neighborhood structure and to combine the migration and diffusion model in an elegant way, as shown by Sprave [Spr90, Spr93]. Finally, it is important to mention that the most time consuming component of an evolution strategy may consist in the evaluation of objective function values or of the constraints which is often the case for practical applications, especially when evaluating f and g j requires to run a ....

Sprave J. (December 1990) Parallelisierung Genetischer Algorithmen zur Suche und Optimierung. Diploma thesis, University of Dortmund.

....a traditional EA needs to know the fitnesses of all individuals during the reproduction phase of the algorithm. This kind of global knowledge makes an algorithm unsuitable for an efficient parallel implementation. Therefore, most parallel implementations of EAs base on local reproduction rules [7, 5, 12, 8, 11] which can be applied simultaneously to smaller subsets of the population. In order to be comparable to a standard GA, in [10] a localized proportionate selection was defined for a ring topology. In the following a more general definition is given which does not even depend on homogeneous ....

J. Sprave. Parallelisierung Genetischer Algorithmen zur Suche und Optimierung. Diplomarbeit, University of Dortmund, Department of Computer Science, 1990.

....everywhere within the population, i.e. the population does not possess a spatial structure. Recent experiences, however, reveal that GAs with a spatial population structure are not only easily to map onto massively parallel computers but also offer a better solution quality than traditional GAs [11, 5, 17, 12, 16]. Recently, this approach was also used for continuous search spaces in the framework of evolution strategies [13, 14, 18] as well as for hybrid parallel versions of evolutionary algorithms and simulated annealing [10, 14] It was recognized several times that these fine grained parallel ....

.... for continuous search spaces in the framework of evolution strategies [13, 14, 18] as well as for hybrid parallel versions of evolutionary algorithms and simulated annealing [10, 14] It was recognized several times that these fine grained parallel algorithms may be regarded as cellular automata [17, 19, 21]. To provide a theoretical framework to study the differences we formally present a GA as a probabilistic cellular automaton, in which all genetic operators are applied locally in a certain neighborhood. This requires a modification of the proportionate reproduction or selection mechanism of ....

J. Sprave. Parallelisierung Genetischer Algorithmen zur Suche und Optimierung. Diploma thesis, University of Dortmund, Department of Computer Science, December 1990.

....a traditional EA requires information about the fitnesses of all individuals during the reproduction phase. This kind of global knowledge makes an algorithm unsuitable for an efficient parallel implementation. Therefore, most parallel implementations of EAs base on local reproduction rules [7, 5, 13, 8, 12, 9, 14] which can be applied simultaneously to smaller subsets of the population. In order to be comparable to a standard GA, in [11] a localized proportionate selection was defined for a ring topology. In the following a more general definition is given which does not even depend on homogeneous ....

J. Sprave. Parallelisierung Genetischer Algorithmen zur Suche und Optimierung. Diplomarbeit, University of Dortmund, Department of Computer Science, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC