FSA人工鱼群算法用MATLAB编程实现,有很高的价值,体现了人工鱼群算法的特点,保证能运行, (2017-12-09, matlab, 1KB, 下载3次)
http://www.pudn.com/Download/item/id/1512782202449330.html
自适应信号处理的学习程序,matlab编程实验自适应的信号处理,
Study of adaptive signal processing program, matlab programming experiment of adaptive signal processing, (2017-05-14, matlab, 111KB, 下载2次)
数值计算方法的一些题,应用matlab编程,大家快下 不错的
Numerical calculation method of some problem, application of matlab programming, everybody good fast (2017-05-13, matlab, 2KB, 下载1次)
基于免疫网络模型的免疫算法源程序,MATLAB编程,仅供大家参考
The immune algorithm based on immune network model source program, MATLAB programming, is only for your reference (2017-05-13, matlab, 5KB, 下载1次)
matlab编程样式指南,matlab编程指导书籍 不错的
Matlab programming style guide, the matlab programming guide books are good (2017-05-12, matlab, 265KB, 下载1次)
学习和使用matlab和c语言混合编程的文件,推荐给大家 不错的
Learning and using matlab and c language programming, good recommend to everyone (2017-05-12, matlab, 120KB, 下载1次)
数字的任意排序，为程序员的编程提供了一些基本编程的想法，可以一次为依据更加深入的开发。
Any sort of digital, provides some basic programming ideas for the programmer, can develop a more in-depth basis. (2014-11-02, matlab, 1KB, 下载3次)
改进DV-Hop定位算法
首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。
第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。
第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。
第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。
第五步用极大似然估计法求未知节点坐标
Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes (2012-06-08, matlab, 1KB, 下载621次)
最小生成树 采用C程序编程实现的PRIM算法
Minimum spanning tree using C programming algorithm to achieve the PRIM (2008-11-19, matlab, 1KB, 下载1次)
数值分析编程,一个作业题,比较简单,试试应该还可以吧
Numerical Analysis of programming, a job title is relatively simple, try it should also (2008-06-23, matlab, 43KB, 下载2次)