Ant-colony-optimization

基于s函数的spw仿真程序简单易懂便于操作(SPW simulation based on s function)

说明：  <<小波分析理论与matlab r2007实现>>教材中的源代码(&lt &lt Wavelet analysis theory and the realization of matlab r2007&gt &gt materials in the source code)

greedy algorithm in OFDM resource allocation (single user)

tjis program estimate the cumulant order (6,3) for mpsk modulation and plot these cumulant for each modulation

system encryption matlab code using advanced system

matlab课程编程【谷速软件】自适应中值滤波 (matlab programming courses [Valley] speed adaptive median filtering software)

gslx680 rockchip 源码 兼容gsl1680,gsl1680E，gsl2680.gsl2682,gsl3680,gsl3680B,gsl3670(gslx680 rockchip source)

To calculate gravitation field between moon and earth using charge simulation methods

基于simulink的光伏电池的最大功率的仿真，电导增量法，扰动观察法(Simulation of maximum power of photovoltaic cell based on Simulink, conductance increment method, perturbation method)

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)