<table id="uwui4"></table>
解國際象棋的N皇后問題的C++源代碼，可用于大學計算機技術課程《算法分析》上機聯系
上傳時間： 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
標簽： classification support machine Ltrain
上傳時間： 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.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
計算矢量所在扇區的N模型，判斷當前的扇區
上傳時間： 2013-12-18
上傳用戶：kr770906
A book about Java I/O
上傳時間： 2015-09-05
上傳用戶：秦莞爾w
題目：N個進程的調度程序 算法：采用最高優先數優先的調度算法和先來先服務算法
上傳時間： 2013-12-21
上傳用戶：zjf3110
利用周期圖法對序列的功率譜進行估計。數據窗采用漢明窗。假設在白噪聲中分辨這三個不同頻率的正弦信號,其相位是均勻分布在2PI的獨立隨機變量,而 是一個單位白噪聲.生成50個長度為N=512的 的樣本序列集合。
上傳時間： 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.
標簽： symbols length Hard-decision Codeword
上傳時間： 2014-07-08
上傳用戶：曹云鵬
在S3C2410平臺上做視頻顯示源碼,可以顯示圖片,觸碰螢幕會顯示座標等
標簽： S3C2410
上傳時間： 2014-01-25
上傳用戶：戀天使569
這是一個關于長度為2的N次方的DCT算法演示程序.
上傳時間： 2015-09-08
上傳用戶：zhaoq123
<center id="q68gc"></center>