多階段決策過(guò)程（ multistep decision PROCESS ）是指 這樣一類(lèi)特殊的活動(dòng)過(guò)程，過(guò)程可以按時(shí)間順序分解成若干個(gè)相互聯(lián)系的階段，在每一個(gè)階段都需要做出決策，全部過(guò)程的決策是一個(gè)決策序列。 動(dòng)態(tài)規(guī)劃 （ dynamic programming ）算法 是解決 多階段決策過(guò)程最優(yōu)化問(wèn)題 的一種常用方法，難度比較大，技巧性也很強(qiáng)。利用動(dòng)態(tài)規(guī)劃算法，可以?xún)?yōu)雅而高效地解決很多貪婪算法或分治算法不能解決的問(wèn)題。動(dòng)態(tài)規(guī)劃算法的基本思想是：將待求解的問(wèn)題分解成若干個(gè)相互聯(lián)系的子問(wèn)題，先求解子問(wèn)題，然后從這些子問(wèn)題的解得到原問(wèn)題的解； 對(duì)于重復(fù)出現(xiàn)的子問(wèn)題，只在第一次遇到的時(shí)候?qū)λM(jìn)行求解，并把答案保存起來(lái)，讓以后再次遇到時(shí)直接引用答案，不必重新求解 。動(dòng)態(tài)規(guī)劃算法將問(wèn)題的解決方案視為一系列決策的結(jié)果，與貪婪算法不同的是，在貪婪算法中，每采用一次貪婪準(zhǔn)則，便做出一個(gè)不可撤回的決策；而在動(dòng)態(tài)規(guī)劃算法中，還要考察每個(gè)最優(yōu)決策序列中是否包含一個(gè)最優(yōu)決策子序列，即問(wèn)題是否具有最優(yōu)子結(jié)構(gòu)性質(zhì)。
標(biāo)簽： multistep decision PROCESS 過(guò)程
上傳時(shí)間： 2015-06-09
上傳用戶(hù)：caozhizhi
speech signal PROCESS tools
標(biāo)簽： PROCESS speech signal tools
上傳時(shí)間： 2013-12-22
上傳用戶(hù)：123啊
matlab矩陣處理例程。A matrix PROCESSor, Matx_Proc() is developed which can be used to PROCESS and edit matrices and state space models, and perform various kind of matrix analysis in a visible way.
標(biāo)簽： Matx_Proc developed PROCESSor PROCESS
上傳時(shí)間： 2015-06-23
上傳用戶(hù)：Breathe0125
matlab7@digital signal PROCESS enjoy!
標(biāo)簽： digital PROCESS matlab signal
上傳時(shí)間： 2015-07-01
上傳用戶(hù)：fandeshun
這個(gè)章節(jié)將詳細(xì)介紹Windows CE 系統(tǒng)中的處理程序 (PROCESS) 和執(zhí)行緒 (thread)，並對(duì)Windows CE作業(yè)系統(tǒng)所使用的排程策略進(jìn)行分析。處理程序是資源分配的基本單位，而執(zhí)行緒是排程的基本單位。
標(biāo)簽： Windows PROCESS thread CE
上傳時(shí)間： 2015-07-01
上傳用戶(hù)：cx111111
A program to demonstrate the optimization PROCESS of particle swarm optimization. A two-dimensional objective function is visualized by level of grey: the lighter the color, the higher the function value. The particles are shown as red circles, their trajectory as red lines.
標(biāo)簽： optimization two-dimensional demonstrate particle
上傳時(shí)間： 2013-12-22
上傳用戶(hù)：Andy123456
A program to demonstrate the optimization PROCESS of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
標(biāo)簽： optimization demonstrate the traveling
上傳時(shí)間： 2015-07-12
上傳用戶(hù)：偷心的海盜
opnet PROCESS 無(wú)線系統(tǒng)仿真，有關(guān)802.16 qos的部分模塊仿真代碼
標(biāo)簽： PROCESS opnet 無(wú)線系統(tǒng) 仿真
上傳時(shí)間： 2013-12-24
上傳用戶(hù)：ardager
The Personal Software PROCESS (PSP) shows engineers how to: 1)manage the quality of their projects 2)make commitments they can meet 3)improve estimating and planning 4)reduce defects in their products
標(biāo)簽： engineers Personal Software projects
上傳時(shí)間： 2014-12-05
上傳用戶(hù)：Avoid98
how to PROCESS the file
標(biāo)簽： PROCESS file how the
上傳時(shí)間： 2015-07-19
上傳用戶(hù)：zuozuo1215
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
