Contact
How to shop
Delivery
Shopping guide
Analyses of Evolutionary Algorithms
Theoretical Runtime Analyses for Evolutionary Algorithms and Probability Theoretical Tools for such Analyses
English
116 b
Up to 30 days for returns
Customers also purchased
/
Paperback
29.48
€
/
Paperback
14.38
€
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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
14.79
€
/
Paperback
58.77
€
