Code: 06902873
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 understand ... more
English
48.04 €
RRP: 56.38 €
You save 8.34 €

You get 116 loyalty points
Book synopsis
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.
Book details
Book category Books in English Mathematics & science Mathematics
48.04 €
English
Collection points Bratislava a 13294 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
26592 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )