Empirical Algorithmics
Computer science, Empirical method, Algorithm
978-613-7-31172-1
6137311724
64
2012-06-01
29.00 €
eng
https://images.our-assets.com/cover/230x230/9786137311721.jpg
https://images.our-assets.com/fullcover/230x230/9786137311721.jpg
https://images.our-assets.com/cover/2000x/9786137311721.jpg
https://images.our-assets.com/fullcover/2000x/9786137311721.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Empirical algorithmics (sometimes also called experimental algorithmics) is the area within computer science that uses empirical methods to study the behaviour of algorithms. It can be used in the analysis of algorithms.Methods from empirical algorithmics complement theoretical methods for the analysis of algorithms. Through the principled application of empirical methods, particularly from statistics, it is often possible to obtain insights into the behaviour of algorithms that are (currently) inaccessible to theoretical analysis, in particular, high-performance heuristic algorithms for hard combinatorial problems. Empirical methods can also be used to achieve substantial improvements in algorithmic efficiency.
https://www.morebooks.de/books/cn/published_by/duc/189866/products
普通自然科学
https://www.morebooks.de/store/cn/book/empirical-algorithmics/isbn/978-613-7-31172-1