scholarly journals General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms*

2014 ◽  
Vol 22 (3) ◽  
pp. 405-437 ◽  
Author(s):  
Jörg Lässig ◽  
Dirk Sudholt

We present a general method for analyzing the runtime of parallel evolutionary algorithms with spatially structured populations. Based on the fitness-level method, it yields upper bounds on the expected parallel runtime. This allows for a rigorous estimate of the speedup gained by parallelization. Tailored results are given for common migration topologies: ring graphs, torus graphs, hypercubes, and the complete graph. Example applications for pseudo-Boolean optimization show that our method is easy to apply and that it gives powerful results. In our examples the performance guarantees improve with the density of the topology. Surprisingly, even sparse topologies such as ring graphs lead to a significant speedup for many functions while not increasing the total number of function evaluations by more than a constant factor. We also identify which number of processors lead to the best guaranteed speedups, thus giving hints on how to parameterize parallel evolutionary algorithms.

2015 ◽  
Vol 23 (4) ◽  
pp. 559-582 ◽  
Author(s):  
Andrea Mambrini ◽  
Dirk Sudholt

The migration interval is one of the fundamental parameters governing the dynamic behaviour of island models. Yet, there is little understanding on how this parameter affects performance, and how to optimally set it given a problem in hand. We propose schemes for adapting the migration interval according to whether fitness improvements have been found. As long as no improvement is found, the migration interval is increased to minimise communication. Once the best fitness has improved, the migration interval is decreased to spread new best solutions more quickly. We provide a method for obtaining upper bounds on the expected running time and the communication effort, defined as the expected number of migrants sent. Example applications of this method to common example functions show that our adaptive schemes are able to compete with, or even outperform, the optimal fixed choice of the migration interval, with regard to running time and communication effort.


2018 ◽  
Vol 12 (2) ◽  
pp. e0006234 ◽  
Author(s):  
Jorge Velázquez-Castro ◽  
Andrés Anzo-Hernández ◽  
Beatriz Bonilla-Capilla ◽  
Moisés Soto-Bajo ◽  
Andrés Fraguela-Collar

Author(s):  
Anna Clara Balbina Silva ◽  
Afonso Pelli

Compreender os mecanismos que regulam a dinâmica das populações espacialmente estruturadas é um desafio crítico para os ecólogos e gestores de conservação. A dinâmica de populações é um ramo da ecologia que estuda as populações como sistema em atividades, relacionando as influências ambientais com a distribuição e abundância dos indivíduos e suas interações com o ambiente. O presente artigo é uma revisão bibliográfica, com o objetivo de identificar produções científicas relevantes sobre dinâmica populacional. Para isso, foram utilizados periódicos revisados por pares, na base de Periódicos Capes. A pesquisa foi realizada em junho de 2019, utilizando-se as palavras-chave para título contendo: "population dynamics" e no assunto “ecology”, a partir de 2014, quando o texto completo estava disponível. Foram considerados como critérios de exclusão os artigos publicados antes de 2014. Após a leitura dos títulos dos artigos, foram selecionados 34 artigos que foram lidos na íntegra. Em livros disponíveis no acervo da biblioteca da Universidade Federal do Triângulo Mineiro, foram selecionados quatro livros no tema dinâmica populacional. O referencial teórico aborda os aspectos da dinâmica de populações, tabela de vida, formas de crescimento e interações populacionais. Ressalta-se a necessidade de novos estudos que ainda possuem lacunas, que venha complementar e contribuir para o conhecimento de organismos que faltam ou ainda não possuem registros de estudos. Palavras-chave: Taxas de Natalidade e Mortalidade. Atributos Populacionais. Dispersão. AbstractUnderstanding the mechanisms that regulate the dynamics of spatially structured populations is a critical challenge for ecologists and conservation managers. Population dynamics is a branch of ecology that studies populations as a system in activities, relating environmental influences to the individuals’ distribution and abundance and their interactions with the environment. This article is a bibliographic review, aiming to identify relevant scientific productions about population dynamics. Thus. peer-reviewed journals were used in the Capes Periodicals base, the research was conducted in June 2019, using the keywords for title containing "population dynamics" and in the subject "ecology", from 2014, when the full text was available. Exclusion criteria were: articles published before 2014, after reading the article titles, 34 articles were selected that met the initially proposed criteria and were read in full. In books available in the library collection of the Federal University of Triângulo Mineiro, with a search for the dynamic population theme, 4 books were used. The theoretical framework addresses the aspects of population dynamics, life table, forms of growth and population interactions. It is emphasized  the need for further studies that still have gaps, which will complement and contribute to the knowledge of organisms that are missing or do not have study records. Keywords: Birth and Mortality Rates. Population Attributes. Dispersion.


10.37236/9449 ◽  
2020 ◽  
Vol 27 (3) ◽  
Author(s):  
Xiaoyu He ◽  
Ray Li
Keyword(s):  

Recently, Farnik asked whether the hat guessing number $\mathrm{HG}(G)$ of a graph $G$ could be bounded as a function of its degeneracy $d$, and Bosek, Dudek, Farnik, Grytczuk and Mazur showed that $\mathrm{HG}(G)\ge 2^d$ is possible. We show that for all $d\ge 1$ there exists a $d$-degenerate graph $G$ for which $\mathrm{HG}(G) \ge 2^{2^{d-1}}$. We also give a new general method for obtaining upper bounds on $\mathrm{HG}(G)$. The question of whether $\mathrm{HG}(G)$ is bounded as a function of $d$ remains open.


Sign in / Sign up

Export Citation Format

Share Document