资源列表
[matlab例程] matlab_ofdm
说明:基于matlab的瑞利信道条件下OFDM的系统仿真-Rayleigh channel matlab-based OFDM system simulation under conditions<maxushuang> 在 2025-06-15 上传 | 大小:4kb | 下载:0
[matlab例程] SOA
说明:Seeker optimization algorithm(SOA)is an ovelpopulation-based heuristics tochastic search algorithm which is based on the concep to f simulating the act of human searching In the SOA,the search direction is determined by seeker’segotistic behavior,alt<sina valizade> 在 2025-06-15 上传 | 大小:4kb | 下载:0
[matlab例程] code
说明:Convergence analysis and performance of the extended artificial physics optimization algorithm.artificial physics optimization (EAPO), a population-based, stochastic, evolutionary algorithm (EA) for multidimensional search and optimization. EAP<sina valizade> 在 2025-06-15 上传 | 大小:2kb | 下载:0
[matlab例程] code3
说明:Cockroach Swarm Optimization a new bionic algorithm, entitled Cockroach Swarm Optimization (CSO), that is inspired by the social behavior of cockroaches. We construct some models by imitating the foraging behaviors of cockroach, and describe<sina valizade> 在 2025-06-15 上传 | 大小:2kb | 下载:0
[matlab例程] code4
说明:optimization algorithm SPSA is very new algorithm.<sina valizade> 在 2025-06-15 上传 | 大小:2kb | 下载:0
[matlab例程] code
说明:Directed searching optimization algorithm for constrained optimization problems. A directed searching optimization algorithm (DSO) is proposed to solve constrained optimization problems The proposed algorithm includes two important operations — pos<sina valizade> 在 2025-06-15 上传 | 大小:2kb | 下载:0
[matlab例程] OFDM_espalhamentoespectro
说明:OFDM SPREAD SPECTRUM<djfmm> 在 2025-06-15 上传 | 大小:886kb | 下载:0
[人工智能/神经网络/遗传算法] Exercise1-Sparse-Autoencoder
说明:网址:http://deeplearning.stanford.edu/wiki/index.php/Exercise:Sparse_Autoencoder斯坦福深度学习的教程,这个是稀疏编码的的练习,可以直接运行-URL: http://deeplearning.stanford.edu/wiki/index.php/Exercise:Sparse_Autoencoder Stanford deep learning tutorial, this is a sparse coding exer<BeSky> 在 2025-06-15 上传 | 大小:134kb | 下载:0
[数据结构常用算法] PostDistance
说明: 本作业为邮局选址问题。在该问题中,求邮局的最佳位置即求坐标的中位数。分解来看,即分别寻找X和Y坐标的中位数。 类设计如下:设计一个PostCal的类。计算X,Y坐标的中位数方法selectMedian(),其中partition()用于将大问题分解为子问题使用。最后有一个计算邮局到各居民点的路径总和int calSum()。 类中包含构造函数PostCal(),主要功能是实现文件读写,结果计算及输入输出。 类中包含取居民点个数的变量 num。-This job is a pos<柴鹰> 在 2025-06-15 上传 | 大小:7kb | 下载:0