1.功能 用高斯方法計(jì)算n重積分(C語言) 2.參數(shù)說明 int n : 積分重?cái)?shù) int js[n] : js[k]表示第k層積分區(qū)間所劃分的子區(qū)間 void (*ss)() : 指向計(jì)算各層積分上、下限的函數(shù)名(用戶自編) double (*f)() : 指向計(jì)算被積函數(shù)值的函數(shù)名(用戶自編) double gaus() : 函數(shù)返回積分值 3.文件說明 gaus.c為函數(shù)程序 gaus0.c為主函數(shù)程序
上傳時(shí)間： 2014-01-05
上傳用戶：731140412
解國際象棋的N皇后問題的C++源代碼，可用于大學(xué)計(jì)算機(jī)技術(shù)課程《算法分析》上機(jī)聯(lián)系
上傳時(shí)間： 2014-01-01
上傳用戶：yyyyyyyyyy
support vector classification machine ％ soft margin ％ uses "kernel.m" ％ ％ xtrain: (Ltrain,N) with Ltrain: number of points N: dimension ％ ytrain: (Ltrain,1) containing class labels (-1 or +1) ％ xrun: (Lrun,N) with Lrun: number of points N: dimension ％ atrain: alpha coefficients (from svcm_train on xtrain and ytrain) ％ btrain: offest coefficient (from svcm_train on xtrain and ytrain) ％ ％ ypred: predicted y (Lrun,1) containing class labels (-1 or +1) ％ margin: (signed) separation from the separating hyperplane (Lrun,1
標(biāo)簽： classification support machine Ltrain
上傳時(shí)間： 2015-09-04
上傳用戶：問題問題
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶：lhc9102
計(jì)算矢量所在扇區(qū)的N模型，判斷當(dāng)前的扇區(qū)
上傳時(shí)間： 2013-12-18
上傳用戶：kr770906
A book about Java I/O
上傳時(shí)間： 2015-09-05
上傳用戶：秦莞爾w
九十三學(xué)年 度 全國大學(xué)校院嵌入式軟體設(shè)計(jì)競賽 多媒體組決賽報(bào)告書 具效能與耗電可調(diào)適性之智慧型數 位相機(jī)
標(biāo)簽： 63886 63849 64001 嵌入式
上傳時(shí)間： 2014-11-29
上傳用戶：jjj0202
題目：N個(gè)進(jìn)程的調(diào)度程序 算法：采用最高優(yōu)先數(shù)優(yōu)先的調(diào)度算法和先來先服務(wù)算法
標(biāo)簽： 算法 進(jìn)程 調(diào)度 程序
上傳時(shí)間： 2013-12-21
上傳用戶：zjf3110
利用周期圖法對序列的功率譜進(jìn)行估計(jì)。數(shù)據(jù)窗采用漢明窗。假設(shè)在白噪聲中分辨這三個(gè)不同頻率的正弦信號,其相位是均勻分布在2PI的獨(dú)立隨機(jī)變量,而 是一個(gè)單位白噪聲.生成50個(gè)長度為N=512的 的樣本序列集合。
上傳時(shí)間： 2013-12-15
上傳用戶：sammi
Hard-decision decoding scheme Codeword length (n) : 31 symbols. Message length (k) : 19 symbols. Error correction capability (t) : 6 symbols One symbol represents 5 bit. Uses GF(2^5) with primitive polynomial p(x) = X^5 X^2 + 1 Generator polynomial, g(x) = a^15 a^21*X + a^6*X^2 + a^15*X^3 + a^25*X^4 + a^17*X^5 + a^18*X^6 + a^30*X^7 + a^20*X^8 + a^23*X^9 + a^27*X^10 + a^24*X^11 + X^12. Note: a = alpha, primitive element in GF(2^5) and a^i is root of g(x) for i = 19, 20, ..., 30. Uses Verilog description with synthesizable RTL modelling. Consists of 5 main blocks: SC (Syndrome Computation), KES (Key Equation Solver), CSEE (Chien Search and Error Evaluator), Controller and FIFO Register.
標(biāo)簽： symbols length Hard-decision Codeword
上傳時(shí)間： 2014-07-08
上傳用戶：曹云鵬
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
