| 書目名稱 | Experimental Methods for the Analysis of Optimization Algorithms |
| 編輯 | Thomas Bartz-Beielstein,Marco Chiarandini,Mike Pre |
| 視頻video | http://file.papertrans.cn/319/318874/318874.mp4 |
| 概述 | First book to offer full treatment on this subject.Contributor include leading scientists in algorithm design, statistical design, optimization and heuristics.Most chapters provide theoretical backgro |
| 圖書封面 |  |
| 描述 | .In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. .This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scien |
| 出版日期 | Book 2010 |
| 關(guān)鍵詞 | Algorithm engineering; Algorithms; Combinatorial optimization; Evolutionary algorithms; Experiment desig |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-02538-9 |
| isbn_softcover | 978-3-642-44590-3 |
| isbn_ebook | 978-3-642-02538-9 |
| copyright | Springer-Verlag Berlin Heidelberg 2010 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-26 05:02
發(fā)表于 2025-3-21 19:56:00
