-
antsmenu
function of ant colony search algorithm in easy method
- 2010-09-06 21:10:49下载
- 积分:1
-
C
说明: C高级编程,是提高的好书,希望大家认真阅读,我还会陆续发资料(C high-level programming)
- 2010-09-18 01:13:24下载
- 积分:1
-
Robotic-comfort-zones
关于机器人舒适度区域的研究文章,外国人写的。(Comfort zone on the robot research articles written by foreigners.)
- 2013-08-23 09:39:32下载
- 积分:1
-
prj2AFinal
training a neural networks using error back propagation algorithm
- 2014-12-19 01:46:52下载
- 积分:1
-
filt1D
超声成像得到的射频信号转换为包络信号时的一维滤波(RF signals into ultrasound imaging to obtain one-dimensional filtering of the envelope signal when)
- 2013-12-03 05:06:11下载
- 积分:1
-
MATLAB入门教程
适合初级学习MatLab的用户使用,讲解的比较清晰,很适合于学习(suitable for the initial study MatLab users, on the clear, well suited to learning)
- 2005-03-30 11:04:38下载
- 积分:1
-
matlab_FinElAnal
Finite Element Analasys made in Matlab
- 2009-12-28 17:16:56下载
- 积分:1
-
DDalgorithm
DD算法实现语音增强,噪声谱估计,根据寂静帧和后面能量的对比来估计(DD algorithm speech enhancement, noise spectrum estimation, based on comparative silence frame and rear energy to estimate)
- 2020-07-10 10:38:55下载
- 积分:1
-
Flashover-voltage-analysis
本软件可以实现闪络电压在不同环境条件下的分析,并绘制相应的闪络电压图,对实际结果具有指导意义。(The software can analyze the flashover voltage under different environmental conditions, and draw the corresponding flashover voltage graph has a guiding significance for the actual results.)
- 2020-11-08 10:29:48下载
- 积分:1
-
matlab_3_opt
提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。
bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
(Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
- 2007-09-20 19:35:15下载
- 积分:1