Evolutionary algorithms (EAs) are metaheuristics that learn from natural collective behavior and are applied to solve optimization problems in domains such as scheduling, engineering, bioinformatics, and finance. Such applications demand acceptable solutions with high-speed execution using finite computational resources. Therefore, there have been many attempts to develop platforms for running parallel EAs using multicore machines, massively parallel cluster machines, or grid computing environments. Recent advances in general-purpose computing on graphics processing units (GPGPU) have...
Evolutionary algorithms (EAs) are metaheuristics that learn from natural collective behavior and are applied to solve optimization problems in doma...
Main concepts of quasi-stationary distributions (QSDs) for killed processes are the focus of the present volume. For diffusions, the killing is at the boundary and for dynamical systems there is a trap. The authors present the QSDs as the ones that allow describing the long-term behavior conditioned to not being killed. Studies in this research area started with Kolmogorov and Yaglom and in the last few decades have received a great deal of attention. The authors provide the exponential distribution property of the killing time for QSDs, present the more general result on their existence and...
Main concepts of quasi-stationary distributions (QSDs) for killed processes are the focus of the present volume. For diffusions, the killing is at the...
