资源列表
Liangyoudunsuanfa
- 梁友栋-Barskey裁剪算法,在裁剪算法中比较快的一种算法,-friends of Liang Dong-Barskey cutting algorithm, the algorithm cutting a faster algorithm,
luxingjia
- 旅行家问题,关于旅行家问题的一小段代码。值得大家学习和参考-travelers, travel home on a small portion of the code. Worth learning and reference
TK
- 旅行家问题 一个旅行家想驾驶汽车以最少的费yi 用从一个城市到另一个城市(假设出发时油箱是空的)。给定两个城市之间的距离为D1、汽车油箱的容量为C(以升为单位),每升汽油能行驶的距离为 D2,出发点每升汽油价格P和沿途油站数N(N可以为零),油站i离出发点距离Di,每升汽油价格Pi(i=1,2...N)。计算结果四舍五入至小数点后两位。 如果无法到达目的地,则输出“No Solution\"。-issue a travel home to travel home to drive a car w
lallala
- 关于最佳贪婪算法的实现 关于最佳贪婪算法的实现
sort
- 先设定随机数发生公式的种子值,根据这个产生一个随机的数组,然后通过插入排序进行排序,并计算运行时间-First occurrence of the formula set random number seed value, the basis of this result in a random array, and then sort through the insertion sort, and calculate the running time
01package
- 01背包算法 解决算法 与众大侠一起参考 交流 -01 knapsack algorithm to solve algorithm and the public with reference to the exchange of heroes
getPrimeNumber
- 非常快的求质数算法,百万数据在毫秒之间。以牺牲空间换取时间代价。-Very fast primes seeking algorithms, millions of data in milliseconds. At the expense of space for time costs.
exBSS
- 瞬时混和盲信号的分离,使用自然梯度法的实现。-Blind signal separation of instantaneous mixing, using natural gradient method of implementation.
applepear
- 这是一个苹果梨分类问题,根据辨识的特点区分出苹果和梨-This is a classification problem apple pear, apple and pear distinguished according to the characteristics of identification
argumentmax
- function I = argmax(X, DIM)
grComp
- matlab编程求最大连通区域,确实可用 很不错-matlab the largestcomponent
conv
- 源码为16QAM调制下的卷积码软判决译码,可参考高阶调制-Source code for convolution code soft decision decoding 16QAM modulation in the section order modulation