资源列表
1..35
- 给某个玩家100元的资本，让他不停押注直到输光，计算需要*多少次？ 如果把次数放在数组ruinLength[]中，进行1000次实验后，看看破产的最大次数、 最小次数和平均次数分别是多少？-100 to a player' s capital, so that he kept until the bet输光to calculate how many times the need for gambling? If the number on the array ruinLengt
ganziqifenlei
- 采用神经网络感知器算法对给定的两类样本进行分类,效果显著!-Perceptron neural network algorithm for a given two types of samples for classification, a significant!
people
- 一个人事管理的c++源程序，应用到数据结构的知识。-Personnel management of a c++ source code, applied to the data structure knowledge.
ICA
- 用ICA信号处理程序，能有效的分离出源信号-Signal processing using ICA can effectively separate the source signals
KNN
- k-nearest neighborhood is a one method that select k number of units in such as cluster that this k units are nearest from the cluster center-k-nearest neighborhood is a one method that select k number of units in such as cluster that this k units ar
dijkstra
- Dijkstra算法的C语言实现，输入参数包括三部分： 1)图中的节点个数 2)图的权值矩阵，其中，不相邻的两节点间输入较大的数100表示 ； 3)给定源节点，如输入1表示以1节点为源节点；输入2表示以2节点为源节点，依次类推。 -Dijkstra algorithm in C language
gj
- 本程序是用来求实对称正定矩阵的逆矩阵的C语言实现方法-This procedure is used to realistic symmetric positive definite matrix of the C language method
bpapproachrev
- 使用BP网络对反函数进行逼近。使用三层网络，隐单元数选择为20个，故总体结构为1-20-1结构。-BP network used to approximate the inverse function. Using the three networks, the number of hidden units is selected as 20, so the overall structure of 1-20-1 structure.
primesrennting
- 线性素数筛选发&0到100万的因子个数 ACM简单算法，筛选法，线性筛选加上因子数-Linear prime screening hair & 0 to 1 million the number of factors ACM simple algorithm, filtering, linear filtering with the number of factors
estimate_a_part2
- 此程序碼是使用L-Dmethod來計算AR模型之參數-This program is the use of L-Dmethod code to calculate the parameters of AR model
Chaotic-parameter-modulation
- 基于混沌参数调制技术，研究混沌反同步在密保通信的应用-请键入文字或网站地址，或者上传文档。 取消 Jīyú hùndùn cānshù tiáozhì jìshù, yánjiū hùndùn fǎn tóngbù zài mì bǎo tōngxìn de yìngyòng 您是不是要找： 婚Chaotic parameter modulation technology, research and application of anti-synchronization of cha
thitasys
- there is a positioning code : using angle measurement to do the root mean square method. and the solution (position) will converge finally