资源列表
tenfing_v71
- 针对EMD方法的不足,二维声子晶体FDTD方法计算禁带宽度的例子,利用自然梯度算法。- For lack of EMD, Dimensional phononic crystals FDTD method calculation examples band gap, Use of natural gradient algorithm.
FruitES
- 小型的水果专家系统，用prolog实现专家系统程序-Small fruit classification system
tenghan
- 基于SVPWM的三电平逆变的matlab仿真，模拟数据分析处理的过程，脉冲响应的相关分析算法并检验。- Based on SVPWM three-level inverter matlab simulation, Analog data analysis processing, Related impulse response analysis algorithm and inspection.
HaffumanCode
- 根据赫夫曼算法求赫夫曼树，根据赫夫曼树求赫夫曼编码-According to Huffman tree Huffman coding requirements
prim
- 普里姆（Prim）算法是一种构造性算法。用于求最小生成树。-Prim algorithm is used for solving the minimum spanning tree.
Kruskal
- kruskal算法是一种求加权连通图的最小生成树的算法。-kruskal algorithm is a weighted connected graph minimum spanning tree algorithm.
DijkstraPath
- Dijkstra算法是由E.W.Dijkstra于1959年提出,又叫迪杰斯特拉算法,它应用了贪心算法模式,是目前公认的最好的求解最短路径的方法。-Dijkstra algorithm greedy algorithm mode, is widely recognized as the best method for solving the shortest path.
criticalpath
- 关键路径法(CPM)是一种用来预测总体项目历时的项目网络分析工具-Critical Path Method (CPM) is a program used to predict the overall duration of the project network analysis tools
MATLAB
- 信号的傅里叶变换，及对信号的时域进行频谱分析的程序代码及说明-Signal is the Fourier transform of the time domain signal and spectrum analysis of the code and descr iption
Astar-to-solve-TSP
- A* 算法的一个应用，货郎担（旅行商）问题。设有n个城市，城市之间均有道路，一个旅行商从某城市出发，经过其余n-1个城市一次且仅一次，最后回到出发的城市，他如何走才能使他所走的路程最短？-Traveling salesman problem and the optimal solution
MATLABJU
- 矩阵和数组的一般操作，包括创建、保存、修改和调用等。 矩阵和数组的加减运算和乘法。 -And general operation of the matrix array, including create, save, modify, and recalls. Matrix and array addition and subtraction and multiplication.
MATLABCA
- 掌握MATLAB的基本绘图命令。 掌握运用MATLAB绘制一、二维、三维图形的方法。 给图形加以修饰。 -Master the use of MATLAB to draw a two-dimensional, three-dimensional graph. To the graphics to be modified.