资源列表
[数据结构常用算法] datastruct_report
说明:数据结构实验 稀疏矩阵压缩存放并实现在压缩存放的基础上转置,相加。压缩包中有源码,可执行文件,还有实验报告 -Experimental data structure sparse matrix compression storage and transpose, the sum on the basis of compressed storage. Compressed package source code, executable file, lab report<sglhsay> 在 2025-07-28 上传 | 大小:58kb | 下载:0
[人工智能/神经网络/遗传算法] MOSHISHIBIE
说明:针对模式识别课程,大家可以参考,也可作为大家利用。-For pattern recognition programs, we can refer to, but also as we take advantage of.<赵旭> 在 2025-07-28 上传 | 大小:58kb | 下载:0
[数据结构常用算法] TRIA
说明:本算法的直线穿越过程通过先找到任何一个与直线相交的三角形(多数情况下是最左边的一个),再分别向两边穿越, 最终找出所有经过的三角形。-A straight line through the process of this algorithm to find any one by first intersected triangle (in most cases is the leftmost one), and then were to both sides through the end<yeast> 在 2025-07-28 上传 | 大小:58kb | 下载:0
[数学计算/工程计算] 3DSurfacePlusSinus
说明:It is a Visual C++ 6.0 (and above) source code to draw 3D funnel and sinus spline on it surface on canvas using ONLY mathematical functions and WinApi. No OpenGl fuctions are used. So you can understand internal mathematical apparatus. Use mouse<vov2000> 在 2025-07-28 上传 | 大小:58kb | 下载:0
[数据结构常用算法] Assignments2-src
说明:一个tic-tac-toe三子棋游戏的代码,可实现人工智能下法和人人对战下法。界面可扩展为n子棋并选择深度优先或者广度优先下法。-A tic-tac-toe three chess game code, and everyone can achieve artificial intelligence war dismount dismount. Interface can be extended to n-game and choose depth-first or breadth-first<susan> 在 2025-07-28 上传 | 大小:58kb | 下载:0
[数学计算/工程计算] 2-D-Energy-Equation-Solution
说明:传统的能量方程为三维的,但是诸多文献证实温度场在轴向方向上是梯度几乎为零的,此时,三维可以降为二维,方程求解更加简便。-The traditional three-dimensional energy equation, but many literature confirm temperature gradient in the axial direction is almost zero, in which case, three-dimensional can be reduced, mo<程控> 在 2025-07-28 上传 | 大小:58kb | 下载:0
[人工智能/神经网络/遗传算法] DFA
说明:有限自动机的实现,可用于固定序列匹配,自然语言处理中的词干提取,词缀切分等-The realization of finite automata can be used for fixed sequence matching, natural language processing stemming, affixes cut grading<汪泱> 在 2025-07-28 上传 | 大小:58kb | 下载:0
[matlab例程] kmedian
说明:The method works as follows. 1. For a data set with dimensionality, d, compute the variance of data in each dimension (column). 2. Find the column with maximum variance call it cvmax and sort it in any order. 3. Divide the data points of cv<mohsen y> 在 2025-07-28 上传 | 大小:58kb | 下载:0