There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.
人気のある作家
J KING (12) JJ TAM (12) yang hu (11) Al Sweigart (8) Mojang AB (8) desti publishhings (7) Hidenori Kusaka (6) John Bach (6) JP TAM (6) Andrea Vedaldi (5) Halonjash Publications (5) Hiro Ainana (5) Horst Bischof (5) Intelligent Feather Publications (5) Jan-Michael Frahm (5) Michael W. Lucas (5) Andrew Park (4) Benjamin Smith (4) Engr. Michael David (4) Harvey Deitel (4)最適なファイルサイズ
10531 KB 1079 KB 1116 KB 1233 KB 2661 KB 370 KB 484 KB 536 KB 649 KB 738 KB 790 KB 10049 KB 1006 KB 10137 KB 1016 KB 102097 KB 1029 KB 10325 KB 1032 KB 1035 KB