-
Multi
多维傅里叶变换，二维DFT快速算法，共分五部--四：三维复序列3D-DFT快速算法-Multi-dimensional Fourier transform, fast algorithm for two-dimensional DFT is divided into 5- 4: Three-dimensional complex sequence of 3D-DFT Fast Algorithm
- 2023-07-04 05:05:03下载
- 积分：1
-
基于混合基算法的快速傅立叶变换和反变换在VDSL2中的应用与实现...
基于混合基算法的快速傅立叶变换和反变换在VDSL2中的应用与实现-Mixed-radix FFT-based fast Fourier transform and inverse transform in the application and implementation of VDSL2
- 2022-08-19 15:42:37下载
- 积分：1
-
单比特树查找算法
单比特树查找算法，是用于路由查找的，内含有路由查找相关资料
- 2022-06-13 12:21:27下载
- 积分：1
-
Matrix的实例
Matrix的实例-Matrix
- 2022-04-01 02:13:52下载
- 积分：1
-
用C编写的一些math函数
用C编写的一些math函数-prepared by the math function
- 2023-06-14 06:20:04下载
- 积分：1
-
模拟退火算法的MATLAB工具箱，matlab toolb最新版本…
matlab模拟退火算法工具箱,最新版本的matlab工具箱-simulated annealing algorithm matlab toolbox, the latest version of matlab toolbox
- 2023-04-05 18:35:04下载
- 积分：1
-
issue a travel home to travel home to drive a car with the minimum of cost yi us...
旅行家问题 一个旅行家想驾驶汽车以最少的费yi 用从一个城市到另一个城市（假设出发时油箱是空的）。给定两个城市之间的距离为D1、汽车油箱的容量为C(以升为单位），每升汽油能行驶的距离为 D2，出发点每升汽油价格P和沿途油站数N（N可以为零），油站i离出发点距离Di,每升汽油价格Pi(i=1,2...N)。计算结果四舍五入至小数点后两位。 如果无法到达目的地，则输出“No Solution"。-issue a travel home to travel home to drive a car with the minimum of cost yi used from one city to another city (assuming starting at the fuel tank was empty). Given the two cities for the distance between D1, car fuel tank capacity of the C (in liters) per liter petrol traveling distance to the D2, the starting point liter gasoline prices P and several petrol stations along the N (N can be zero), PFS i distance from the starting point Di per liter Steam oil prices Pi (i = 1,2 ... N). Calculation results rounded to two decimal places. If unable to reach their destination, the export of "No Solution."
- 2023-09-07 00:25:03下载
- 积分：1
-
％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist )
％...
％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist )
％ Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法，在非线性时间序列中很有用，是常用的算法- [Nearest_neighbours] = find_nearest_neighbours (database, desc, max_dist) Find the indices of the nearest neighbours of the given desriptors in the neighbor-point search algorithm, the nonlinear time series of very useful, is a commonly used algorithm
- 2022-05-24 09:30:26下载
- 积分：1
-
simulated_annealing header file that implements the simulated annealing optimisa...
simulated_annealing header file that implements the simulated annealing optimisation algorithms
- 2022-06-22 00:54:21下载
- 积分：1
-
哲学家就餐问题的两种算法实现
哲学家就餐问题的两种算法实现-Two philosophers eat algorithm
- 2022-01-26 01:36:10下载
- 积分：1
