Greedy Algorithms and Dynamic Programming

Greedy Algorithms and Dynamic Programming

ID:39221593

大?。?05.71 KB

頁數(shù):13頁

時間:2019-06-27

Greedy Algorithms and Dynamic Programming_第1頁
Greedy Algorithms and Dynamic Programming_第2頁
Greedy Algorithms and Dynamic Programming_第3頁
Greedy Algorithms and Dynamic Programming_第4頁
Greedy Algorithms and Dynamic Programming_第5頁
資源描述:

《Greedy Algorithms and Dynamic Programming》由會員上傳分享,免費在線閱讀,更多相關內容在學術論文-天天文庫。

1、ECE750-TXBLecture19:GreedyAlgorithmsandDynamicProgrammingToddL.Veldhuizentveldhui@acm.orgElectrical&ComputerEngineeringUniversityofWaterlooCanadaMarch15,2007Multi-stageDecisionProblemsIIAmulti-stagedecisionproblemisonewherewecanthinkoftheproblemashavingatreestructure:eachtreenoderepresentsadecis

2、ionpoint,andeachdecisionleadsustoanotherdecisiontobemade.IForexample:chooseasmanyelementsoftheset{1,3,7,9,13}aspossiblewithoutexceeeding21.Wecanviewthisasatree:{}{1}{3}{7}{9}{13}{1,3}{1,7}{1,9}{1,13}Herewehavedecidedtoinclude1intheset,whichopensupafurthersetofchoices.GreedyalgorithmsIIAgreedyalg

3、orithmalwayschoosesthemostattractiveoptionavailabletoit:eachdecisionismadebasedonitsimmediatereward.IForexample,wemightpickelementsoftheset{1,3,7,9,13}accordingtotheirbene?t-costratio:picking3,forexample,increasesthesizeofthesetby1(bene?t)whileincreasingthesumby3(cost),sowewouldassignitabene?t-c

4、ostratioof1.Choosingelementsaccordingtothisschemegivestheset3{1,3,7,9}.IKruskal’sminimumspanningtreealgorithmisanotherexampleofagreedyalgorithm:ateachstepitchoosestheedgewithminimumcost,withoutthinkingaheadastohowthatmighta?ectfuturedecisions.GreedyalgorithmsIIIGreedyalgorithmsonlyrarelygiveopti

5、malanswers.Surprisinglyoftentheygive“reasonably-good”answers;forexample,greedyalgorithmsareonemethodofobtainingapproximatesolutionstoNP-hardoptimizationproblems.IThereisagreedyalgorithmforconstructingapre?x-freecodethatyieldsanoptimalcode,calledaHu?mancode.IRecallthattheentropyofadiscretedistrib

6、utiononasetofsymbolsSisgivenbyXH(μ)=?μ(si)logμ(si)s∈SAnd,fromShannon’snoiselesscodingtheorem,weknowthereexistsapre?xcodeachievinganaveragecodelengthofc≤H(μ)+1.IHu?man’salgorithmusesagreedymethodtoconstructanoptimalcode:GreedyalgorithmsIII1.Startwithacollectionofsingletontrees,oneforeachsymbol.Fo

7、reachtreewekeeptrackofitsprobability;initiallyeachsingletontreehastheprobabilityofitssymbol.2.Whilethereismorethanonetree,2.1Choosetwotreeswithleastprobabilities;2.2Combinethetwotreesintoonebymakinganewrootwhoseleftchildison

當前文檔最多預覽五頁,下載文檔查看全文

此文檔下載收益歸作者所有

當前文檔最多預覽五頁,下載文檔查看全文
溫馨提示:
1. 部分包含數(shù)學公式或PPT動畫的文件,查看預覽時可能會顯示錯亂或異常,文件下載后無此問題,請放心下載。
2. 本文檔由用戶上傳,版權歸屬用戶,天天文庫負責整理代發(fā)布。如果您對本文檔版權有爭議請及時聯(lián)系客服。
3. 下載前請仔細閱讀文檔內容,確認文檔內容符合您的需求后進行下載,若出現(xiàn)內容與標題不符可向本站投訴處理。
4. 下載文檔時可能由于網絡波動等原因無法下載或下載錯誤,付費完成后未能成功下載的用戶請聯(lián)系客服處理。