资源列表
[matlab例程] energy-detection-method
说明:对基于能量检测的频谱感知的单节点和合作式能量检测做了详细介绍,进行了Matlab仿真,并对仿真进行了性能分析与比较。-Energy detection based spectrum sensing of single node and cooperative energy detection conducted a detailed descr iption and simulation of Matlab simulation performance analysis and comparis<sichen> 在 2025-09-29 上传 | 大小:374kb | 下载:0
[matlab例程] Spectrum-sensing-technology-research
说明:在 Matlab 平台下对能量检测和循环特性检测法进行了建模仿真,比较分析了这两种方法的检测性能。-In Matlab platform for energy detection and detection cycle characteristics were modeling and simulation, comparative analysis of the detection performance of these two methods.<sichen> 在 2025-09-29 上传 | 大小:607kb | 下载:0
[matlab例程] SFM--(local-coordinate-estimation)
说明:三维重建程序,包括数据和代码,用的是SFM的方法,课程设计-Three-dimensional reconstruction program, including data and code, using SFM method, course design<楚冰> 在 2025-09-29 上传 | 大小:55kb | 下载:0
[数学计算/工程计算] dynamic_matrix_mul
说明:动态规划算法实现的矩阵乘法,这个算法在很多ACM竞赛中经常出现的题目-Dynamic programming matrix multiplication algorithm, the algorithm in many ACM contest that often appear in the title<xielei> 在 2025-09-29 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] largest_public_str
说明:动态规划算法实现的最大公共字串的算法实现,非常有效的展现了动态规划算法思想-Algorithm for dynamic programming algorithm to achieve the greatest public string, very effective to show the dynamic programming algorithm ideas<xielei> 在 2025-09-29 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] longest_no_drop_seq
说明:动态规划算法实现的最长不下降序列,非常好的展现了动态规划算法的精髓-The realization of dynamic programming algorithm for the longest do not drop sequence, very good to show the essence of the dynamic programming algorithm<xielei> 在 2025-09-29 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] Knapsack_problem
说明:动态规划算法实现的一类背包问题,经典的动态规划算法实例-A class of dynamic programming algorithm knapsack problem, the classic examples of the dynamic programming algorithm<xielei> 在 2025-09-29 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] Knapsack_problem2
说明:动态规划算法实现的另一类背包问题// 背包问题 6个物体,重量为:5, 2, 1.7, 3.5, 1, 5.1 背包最大10,,追求装下的最大重量-Another knapsack problem dynamic programming algorithm to achieve// knapsack problem six objects, weight: 5, 2, 1.7, 3.5, 1, 5.1 backpacks maximum 10, the pursuit of maximum we<xielei> 在 2025-09-29 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] Knapsack_problem3
说明:动态规划算法实现的背包问题:// 背包问题,容量m,n种货物,分别重量W1,W2......Wn,利润分别P1,P2......Pn,求最大利润 -Knapsack problem dynamic programming algorithm:// knapsack problem, the capacity of M, N type of cargo weight, respectively W1, W2... Wn, profits were P1, P2... Pn, maximum p<xielei> 在 2025-09-29 上传 | 大小:1kb | 下载:0
[数学计算/工程计算] max_num_str
说明:动态规划算法实现: n个数排成一圈,找出和最大的连续数串-The realization of dynamic programming algorithm: the number of N are arranged in a circle, and find the maximum continuous string<xielei> 在 2025-09-29 上传 | 大小:1kb | 下载:0