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.
|Title:||Analyses of Evolutionary Algorithms Analyses of Evolutionary Algorithms||Publisher:||Sudwestdeutscher Verlag Fur Hochschulschrifte|
|No. of Pages:||112|
* The book summary and image may be of a different edition or binding of the same title.
* Book reviews are added by registered customers. They need not necessarily buy book.
* These books are NOT available for reading online or for free download in PDF or ebook format.
* Price can change due to reprinting, price change by publisher or sourcing cost change for imported books.
www.infibeam.com/Books is the biggest online bookstore in India for sale of books at best price - fiction, literature, audiobooks, study guides, novels, story books, rare books, textbooks and books by popular authors. These are available in various editions and bindings e.g. paperback and at best discount.