Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Analyses of Evolutionary Algorithms
Theoretical Runtime Analyses for Evolutionary Algorithms and Probability Theoretical Tools for such Analyses
Angličtina
110 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
713
Kč
/
Brožovaná
311
Kč
Evolutionary algorithms (EAs) are a highly successful tool commonly used in practice to solve algorithmic problems. This remarkable practical value, however, is not backed up by a deep theoretical understanding. Such an understanding would facilitate the application of EAs to further problems. Runtime analyses of EAs are one way to expand the theoretical knowledge in this field. This thesis presents runtime analyses for three prominent problems in combinatorial optimization, namely the Single Source Shortest Path problem, the All-Pairs Shortest Path problem, and the Sorting problem. Additionally, it provides probability theoretical tools that will simplify future runtime analyses of EAs.
Informace o knize
Angličtina
Kategorie
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
339
Kč
/
Brožovaná
1 348
Kč
