" />
這是算法設(shè)計(jì) Algorithm Design, Jon Kleinberg, Eva Tardos下載,進(jìn)行數(shù)學(xué)建模并選擇高效求解算法的訓(xùn)練,為提高學(xué)生的素質(zhì)和創(chuàng)新能力打下必要的基礎(chǔ)。主要內(nèi)容涉及:面對(duì)實(shí)際問題建立數(shù)學(xué)模型、設(shè)計(jì)正確的求解算法、算法的效率估計(jì)、改進(jìn)算法的途徑、問題計(jì)算復(fù)雜度的估計(jì)、難解問題的確定和應(yīng)對(duì)策略等等。本課程是算法課程的基礎(chǔ)部分,主要涉及算法的設(shè)計(jì)、分析與改進(jìn)途徑,其他有關(guān)計(jì)算復(fù)雜性的內(nèi)容將在后續(xù)課程中加以介紹。
Algorithm Design, Jon Kleinberg, Eva Tardos下載,Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age.show more .
算法設(shè)計(jì)Algorithm Design, Jon Kleinberg, Eva Tardos是本課程的內(nèi)容分成兩大部分:算法的基礎(chǔ)知識(shí)、通用算法設(shè)計(jì)技術(shù)與分析方法。
第一部分是算法基礎(chǔ)知識(shí),約占20%,主要介紹算法相關(guān)的基本概念和數(shù)學(xué)基礎(chǔ)。比如,什么是算法的偽碼描述?什么是算法最壞情況下和平均情況下的時(shí)間復(fù)雜度?算法時(shí)間復(fù)雜度函數(shù)的主要性質(zhì),算法復(fù)雜度估計(jì)中常用的數(shù)學(xué)方法,如序列求和及遞推方程求解。
第二部分是通用的算法設(shè)計(jì)技術(shù)與分析方法,主要介紹分治策略、動(dòng)態(tài)規(guī)劃、貪心法、回溯與分支限界。主要介紹這些設(shè)計(jì)技術(shù)的使用條件、分析方法、改進(jìn)途徑,并給出一些重要的應(yīng)用。
Format: Hardback | 864 pages
Dimensions: 206 x 228 x 36mm | 1,578.52g
Publication date: 26 Mar 2005
Publisher: Pearson Education (US)
Imprint: Pearson
Publication City/Country: Boston, MA, United States
Language: English
ISBN10: 0321295358
ISBN13: 9780321295354
Bestsellers rank: 645,031