资源列表
my-topsis
- 详细介绍了逼近理想点排序法（topsis开发实例，对初学者有一定帮助！-Details approximate the ideal point sort (topsis development example, has some help for beginners!
sliding
- 求出sliding window的最大最小值-n array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves ri
cl
- 基本竞争学习算法的程序，是一种硬判决算法-Basic competitive learning algorithm program, is a hard decision algorithm
CCC
- 汉字编码判断程序，识别出汉字的编码方式。如GBK，GBK2312-Chinese character coding to determine procedures for
kkk
- 给定K个单词作为文本的开始。程序每次生成一个单词，其过程为：读取文本中最后的K个单词，并在书中寻找这K个单词连续出现的所有位置，然后从中随机挑选一个位置，并把该位置之后的一个单词加入到文本中。该过程不断重复，直到生成的文本达到最大单词数，或者生成的单词恰好是这本书的最后一个单词。-Given K words as the beginning of the text. Each program generates a word, the process is: read the text in a
8_1
- 多态 实现了多态的 多态的运算，老师的很认可改程序，对多态不熟熟悉的朋友-duotaiyunsuan
recurrent_network
- 用matlab编写的动态递归神经网络，是个例子-recurrent network
fixed-piont-smoothing-estimates
- 做的一次作业，kalman滤波及其固定点估计-kalman estimates and fixed-piont smoothing estimates
stone_game_dp
- 现有4堆石子,两个人轮流取石子,他们有n种可能的取法,取法表示从第1堆取A1个石子,从第2堆中取B1个,第3堆取C1个,第4堆取D1个.如果取的时候某一堆的石子数比所要取的石子数要少,则这种取法是不可行的.取到最后没有可行取法的人就算输了. 现给出4堆石子的石子数目以及n种取法,请问如果两个人都采用最优取法,先取的人是赢还是输.-Four existing heap of stones, two people take turns stones, they have emulated n
circular_array
- 均匀圆阵的常规波束形成，没有使用自适应波束形成。uniform circle array beamform-uniform circle array beamform
LZC
- 用于计算脑电信号或者心电信号的LZC复杂度，基于MATLAB开发-Use for calculating the LZC with one-dimensional vector.
Armstrong
- C++ code to check whether the input number is an armstrong number or not.