k-step ahead predictions determined by simulation of the % one-step ahead neural network predictor. For NNARMAX % models the residuals are set to zero when calculating the % predictions. The predictions are compared to the observed output. %
標(biāo)簽: ahead predictions determined simulation
上傳時(shí)間: 2016-12-27
上傳用戶:busterman
this is a download speed up tool at the internet
標(biāo)簽: download internet speed this
上傳時(shí)間: 2014-01-12
上傳用戶:498732662
FOR ADS STUDY ,ABOUT ADS APPLY AND STEP.
標(biāo)簽: ADS ABOUT APPLY STUDY
上傳時(shí)間: 2017-01-07
上傳用戶:417313137
up-techpxa270 bootloader 文件
標(biāo)簽: up-techpxa bootloader 270
上傳時(shí)間: 2017-01-08
上傳用戶:stella2015
step motor driver, very important c code.thanks.
標(biāo)簽: important driver thanks motor
上傳時(shí)間: 2017-01-12
上傳用戶:515414293
電力市場(chǎng)下確定無(wú)功源價(jià)值的方法探討 因此提出了4種確定無(wú)功價(jià)值的方法:Vs法、PV曲線法、ERC法和Back.up法,分析了不同方法 的特點(diǎn),最后以IEEE30節(jié)點(diǎn)系統(tǒng)為例進(jìn)行了仿真計(jì)算,仿真結(jié)果表明無(wú)功源的價(jià)值取決于電網(wǎng)的結(jié) 構(gòu)、無(wú)功源的位置以及系統(tǒng)的運(yùn)行狀態(tài)。
標(biāo)簽: Back ERC 價(jià)值 電力市場(chǎng)
上傳時(shí)間: 2017-01-17
上傳用戶:003030
void Knight(int i , int j) { // printf("%d %dn",i,j) if (board[i][j] != 0 || i < 0 || i >= Size || j < 0 || j >= Size ) { return } step++ board[i][j]=step if (step == Size*Size) { showboard() system("PAUSE") return } //DFS Knight(i-2,j-1) //left Knight(i-2,j+1) Knight(i+2,j-1) //right Knight(i+2,j+1) Knight(i-1,j-2) //up Knight(i+1,j-2) Knight(i+1,j+2) //down Knight(i-1,j+2) // board[i][j]=0 step-- }
標(biāo)簽: int Knight printf board
上傳時(shí)間: 2014-01-17
上傳用戶:cxl274287265
算法設(shè)計(jì)的實(shí)驗(yàn)報(bào)告 包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的創(chuàng)建堆、堆排序算法、按秩合并算法以及帶路徑壓縮算法、實(shí)現(xiàn)查找第K小元素算法、實(shí)現(xiàn)快速排序算法、實(shí)現(xiàn)平面內(nèi)最接近點(diǎn)對(duì)算法、實(shí)現(xiàn)最長(zhǎng)公共子序列算法、實(shí)現(xiàn)矩陣鏈相乘算法、實(shí)現(xiàn)0/1背包問(wèn)題算法、實(shí)現(xiàn)Dijistra’s算法、Prim算法、Kruskal算法、文件壓縮算法
標(biāo)簽: Bottom-Up Sorting Merge Heaps
上傳時(shí)間: 2017-02-02
上傳用戶:戀天使569
bootup code for Barebone, it s useful for bring up new chip
標(biāo)簽: for Barebone bootup useful
上傳時(shí)間: 2017-02-13
上傳用戶:ryb
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive searching to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標(biāo)簽: contains Output convex planar
上傳時(shí)間: 2017-02-19
上傳用戶:wyc199288
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1