-
c++的程序 有关神经网络的,请站长加我,
c++的程序 有关神经网络的,请站长加我,-c procedures of the neural network, for my head, thank you
- 2022-01-29 01:52:50下载
- 积分:1
-
k-means(欧氏距离)聚类算法是最基本的聚类算法,是理解和应用聚类算法的基础,通过k-means(欧氏距离)聚类算法我们才可以初步了解数据挖掘的原理。-k-means (Euclidean distance) clustering algorithm is the most basic clustering algorithm, is understanding and the basis for the application of clustering algorithm, through the k-means (Euclidean distance) clustering algorithm we are able to a preliminary understanding of the principles of data mining .
- 2022-05-24 13:46:10下载
- 积分:1
-
PID仿真参考书,关于神经网络等方面的书,应用广泛。希望大家积极下载。...
PID仿真参考书,关于神经网络等方面的书,应用广泛。希望大家积极下载。-PID simulation of reference books, such as neural networks on the books, a wide range of applications. Hope that we actively download.
- 2022-11-21 19:35:04下载
- 积分:1
-
学习魔方编程技巧,仅供参考,有信息请反馈。
学习魔方编程技巧,仅供参考,有信息请反馈。-learning programming skills, for reference purposes only, with information feedback. Thank you
- 2022-01-30 20:11:00下载
- 积分:1
-
greedy em hybrid model training algorithm
greedy em 混和模型训练算法-greedy em hybrid model training algorithm
- 2022-04-19 20:59:30下载
- 积分:1
-
这个是SA模拟退火求函数极值用c++编译的程序
这个是SA模拟退火求函数极值用c++编译的程序-the simulated annealing SA is seeking function using extreme procedures c compiler
- 2022-07-02 03:31:22下载
- 积分:1
-
使用模拟退火思想解决ISP(独立集)问题,使用先看说明
使用模拟退火思想解决ISP(独立集)问题,使用先看说明-Thinking of using the simulated annealing solution to ISP (independent set), the use of look at the description
- 2022-03-30 15:32:08下载
- 积分:1
-
The program is based on the MATLAB environment, the issue of PSO realize tsp
该程序是基于MATLAB环境的pso实现tsp问题-The program is based on the MATLAB environment, the issue of PSO realize tsp
- 2022-01-25 16:21:23下载
- 积分:1
-
C#版遗传算法解TSP问题
C#版遗传算法解TSP问题-C# version Genetic Algorithm for the Traveling Salesman Problem
- 2022-02-10 12:38:05下载
- 积分:1
-
遗传算法的matlab实现,举例说明遗传算法的基本实现步骤,适用于初学者...
遗传算法的matlab实现,举例说明遗传算法的基本实现步骤,适用于初学者-Matlab genetic algorithm to achieve, for example, shows the basic implementation steps of genetic algorithm is suitable for beginners
- 2022-03-19 20:18:03下载
- 积分:1