资源列表
IACO
- 对ACO基本算法的改进，主要是针对的信息素的改进。希望对各位有用。-Of the basic ACO algorithm is mainly targeted pheromone improvements. Hope that useful to you.
TIMER3
- it is a timer that i found from some site
stplugin
- head and C source file for application in STATA(you can also download from stata website)-head file for application in STATA (you can also download from stata website)
EVMv1.0
- 信号幅值归一化EVM信号计算,输入信号为无失真参考I/Q信号和观测到的失真I/Q信号-signal magnitude normalization EVM compensate calculation
tiebashuadianji
- 易语言，百度贴吧帖子刷点击器，适合初级学习易语言的人群。-Easy language, Baidu Post Bar Post brush clicks, suitable for primary learning easy language of the crowd.
tsp
- 求解TSP问题，遗传算法的巡航例程，一架飞机进行巡航。-np problem
Demo
- 人生系统 很简单的 往采纳 简单人生规划-Demo rensheng
sicily-code--2
- 本程序是中山大学sicily 1004-1007-1010-1014-1021 参考代码-This program is for sicily 1004-1007-1010-1014-1021 in Sun Yat-Sen University.
Isotropic-Hardening-Plasticity
- A UMAT Isotropic Hardening Plasticity code.
lovewave.m
- love波程序 love波程序 里面包含频谱分析-lvoe wave
vb-f
- vb自动填表源码-vb source code automatically fill in a form-vb source code automatically fill in a form
floyd-knapsack
- floyd knapsack Floyd-Warshall算法（Floyd-Warshall algorithm）是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。Floyd-Warshall算法的时间复杂度为O(N3)，空间复杂度为O(N2)。 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总