资源列表

« 1 2 ... .48 .49 .50 .51 .52 25653.54 .55 .56 .57 .58 ... 28521 »

[数学计算/工程计算MST

说明:最小生成树prim算法matlab实现,计算出总权值和最优连线。-Minimum spanning tree algorithm matlab prim implemented to calculate the total weight and the optimal connection.
<南达> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[数学计算/工程计算Unary-Linear-Regression-Model

说明:最小二乘法拟合一元线性回归函数,并进行显著性和拟合优度检验。-Least squares fit linear regression functions, and for significance and goodness of fit test.
<南达> 在 2025-05-08 上传 | 大小:1kb | 下载:1

[matlab例程EvokedPotentialExtraction

说明:对于单次提取的诱发响应,本程序提供了一种用matlab实现消除诱发响应潜伏期的影响的快捷有效的方法-Eliminate latency of evoked response
<QZhou> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[数学计算/工程计算tsp10

说明:穷举法解决tsp问题 但城市数目不超过11个。-Brute-force method to solve the problem but the city tsp of not more than 11.
<南达> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[数学计算/工程计算SP_d

说明:利用Dijkstra算法计算最短有向路小程序-Dijkstra algorithm using the shortest way there is a small program to
<南达> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[matlab例程liziqun

说明:以Griewank函数为测试对象,应用PSO算法优化求解-Use Griewank function for test object, apply PSO algorithm as the optimal solution
<鲁鲁> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[matlab例程ekf_1

说明:本代码为扩展卡尔曼滤波仿真,适合初学者使用学习。-The extended Kalman filter simulation code, suitable for beginners to learn.
<wang zhen> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[matlab例程Porous_Medium_Flows

说明:多孔介质内流动的格子Boltzmann方法源代码-lattice boltzmann method to simulate fluid flow in porous medium.
<pengbenli> 在 2025-05-08 上传 | 大小:1kb | 下载:1

[数值算法/人工智能pailiezhuhe

说明:排列组合的计算,可用于概率论问题的求解和计算-Permutation and combination of the computation can be used to solve the problem of probability theory and calculations
<li> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[数值算法/人工智能Warshalls-Transitive-Closure

说明:In computer science, the Floyd–Warshall algorithm (also known as Floyd s algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm[clarification needed]) is a graph analysis algorithm for finding short
<ww> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[数值算法/人工智能Bellman-Fords-Shortest-Paths

说明:The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem.
<ww> 在 2025-05-08 上传 | 大小:1kb | 下载:0

[数学计算/工程计算HeapSort

说明:Heapsort is a comparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a well implemented quicksort, it has the advantage of a more favorabl
<ww> 在 2025-05-08 上传 | 大小:1kb | 下载:0
« 1 2 ... .48 .49 .50 .51 .52 25653.54 .55 .56 .57 .58 ... 28521 »

源码中国 www.ymcn.org