-
kopls_1.1.2
pls相关程序，论文附带 pls相关程序，论文附带(pls program, papers incidental pls, papers incidental)
- 2012-06-11 17:26:19下载
- 积分：1
-
matlab
1-32是：图形应用篇33-66是：界面设计篇67-84是：图形处理篇85-100是：数值分析篇(1-32 are: graphics applications, articles 33-66 are: interface design articles 67-84 are: graphics processing chapter 85-100 are: Numerical Analysis Section)
- 2009-12-22 23:50:30下载
- 积分：1
-
uocluongser
it is so important file
- 2010-05-13 01:24:42下载
- 积分：1
-
3
说明： 是关于通信仿真的几个程序，里面有调幅、调频等的仿真程序代码！(Communications simulation on several procedures, which has AM, FM, such as the simulation program code!)
- 2008-07-08 15:36:17下载
- 积分：1
-
ofdmsim
论坛上找的，很多内容，都是以FUNCTION形式呈现，希望对大家有帮助(Forum looking for, many elements are present in the form FUNCTION, we want to help)
- 2010-05-29 22:37:10下载
- 积分：1
-
codePhase1
i am doing my project in image fusion . i send the image fusion program using stationary wavelet transform. so i need image fusion program using different types of transform.
- 2014-11-17 15:22:40下载
- 积分：1
-
EKF_UKF_PFmatlab
EKF_UKF_PF三种算法的比较粒子滤波matlab仿真程序以及EKF_UKF_PF三种算法的比较matlab仿真程序(Comparison EKF_UKF_PF three algorithms particle filter matlab simulation program, and EKF_UKF_PF comparison of the three algorithms matlab simulation program)
- 2012-10-13 00:23:46下载
- 积分：1
-
ExtendedKalmanFilter
扩展卡尔曼滤波程序，自己在用的，效果还可以，给大家参考下(Extended Kalman filtering procedure)
- 2017-06-06 15:47:39下载
- 积分：1
-
code
说明： matlab实现四种最优化搜索方法
共轭梯度法
牛顿法
最速下降法
拟牛顿法
对一个十维函数的极值搜索(matlab optimal search)
- 2020-01-13 22:27:22下载
- 积分：1
-
遗传算法程序
说明： 遗传算法是计算数学中用于解决最佳化的搜索算法，是进化算法的一种。进化算法最初是借鉴了进化生物学中的一些现象而发展起来的，这些现象包括遗传、突变、自然选择以及杂交等。遗传算法通常实现方式为一种计算机模拟。对于一个最优化问题，一定数量的候选解（称为个体）的抽象表示（称为染色体）的种群向更好的解进化。传统上，解用二进制表示（即0和1的串），但也可以用其他表示方法。进化从完全随机个体的种群开始，之后一代一代发生。在每一代中，整个种群的适应度被评价，从当前种群中随机地选择多个个体（基于它们的适应度），通过自然选择和突变产生新的生命种群，该种群在算法的下一次迭代中成为当前种群。(Genetic algorithm (GA) is a search algorithm used to solve optimization in computational mathematics. It is one of evolutionary algorithms.
Evolutionary algorithms were originally developed by borrowing phenomena in evolutionary biology, such as heredity, mutation, natural selection and hybridization.
Genetic algorithms are usually implemented as a computer simulation.
For an optimization problem, an abstract representation of a certain number of candidate solutions (called individuals) (called chromosomes) evolves towards a better solution.
Traditionally, solutions are represented in binary (that is, strings of zeros and ones), but other representations are possible.
Evolution begins with a population of completely random individuals, and it happens from generation to generation.)
- 2020-06-07 21:42:11下载
- 积分：1
