๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel genetic algorithms: a survey and problem state of the art

โœ Scribed by D. S. Knysh; V. M. Kureichik

Book ID
111453927
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
291 KB
Volume
49
Category
Article
ISSN
1064-2307

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complexity of cyclic scheduling problems
Complexity of cyclic scheduling problems: A state-of-the-art survey
โœ Eugene Levner; Vladimir Kats; David Alcaide Lรณpez de Pablo; T.C.E. Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 325 KB

## a b s t r a c t In this survey we review the current complexity status of basic cyclic scheduling models. We start with the formulations of three fundamental cyclic scheduling problems, namely the cyclic jobshop, cyclic flowshop, and cyclic project scheduling problems. We present state-of-the-ar

A network parallel genetic algorithm for
A network parallel genetic algorithm for the one machine sequencing problem
โœ M.K. Mayer ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 626 KB

This paper presents a network parallel genetic algorithm for the one machine sequencing problem. It examines a parallel genetic algorithm in which processors exchange their best solution found at periodic intervals and the case when no exchange is performed. The network parallel genetic algorithm is

Virtual reality: A state-of-the-art surv
Virtual reality: A state-of-the-art survey
โœ Ning-Ning Zhou; Yu-Long Deng ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Institute of Automation, Chinese Academy of Scienc ๐ŸŒ English โš– 205 KB