Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Analyses of Evolutionary Algorithms
Theoretical Runtime Analyses for Evolutionary Algorithms and Probability Theoretical Tools for such Analyses
Engleski
116 b
Do 30 dana za povrat
Kupci su kupili i
/
Meki uvez
28.20
€
/
Meki uvez
13.54
€
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.
Informacije o knjizi
Engleski
Kategorija
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
14.75
€
/
Meki uvez
58.62
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?