-
最短路径算法源码(VB)
最短路径算法源码(VB)-shortest path algorithm source code (VB)
- 2022-03-02 09:37:39下载
- 积分：1
-
code39条形码程序.rar
能较好的识别code39条码，vc编写，易于识别，条形码识别程序，用来识别条形码。可以直接运行
能较好的识别code39条码，vc编写，易于识别，条形码识别程序，用来识别条形码。可以直接运行
- 2023-03-25 08:05:04下载
- 积分：1
-
在直接模拟Monte kalro微管的空气流，我们可以用不同的…
直接蒙特卡洛方法计算微管气体流动，主程序所选择的分子数及模拟单元可以修改，包含7个子程序，和一个随机数函数。-The air flow in micropipe with direct simulation mente kalro, we can use different simulation, fortran90
- 2022-04-15 15:46:28下载
- 积分：1
-
/ = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = /功能annot
//=== === === === === === === =
//函数说明
//函数名称：PolyFit
//函数功能：最小二乘法曲线拟合
//使用方法：double *x ---- 存放n个数据点的X坐标
// double *y ---- 存放n个数据点的Y坐标
// int n -------- 给定数据点个数
// double *a ---- 返回m-1次拟合多项式的m个系数
// int m -------- 拟合多项式的项数，即拟合多项式的最高次为m-1。要求m20，则本函数自动按m=min{n,20}处理
// double *dt --- dt[0]返回拟合多项式与各数据点误差的平方和；dt[1]返回拟合多
// 项式与各数据点的误差绝对值之和；dt[2]返回拟合多项式与各数据
// 点误差绝对值的最大值
//注意事项：拟合多项式的形式为 y = b0 + b1*(x-Xavr)...
-//=== === === === === ==== === === === === === === ==== === =// function annotations// function name : PolyFit// Function functions : Least Squares Curve Fitting// Use : double* x n-store data point coordinates of the X//* y double-storage n data point Y coordinates// int n-------- given the number of data points//* a double---- returned to the m-1 m fit polynomial coefficients// int m-------- polynomial fitting items , which is the highest polynomial fitting time for m-1. Request m
- 2023-07-25 11:15:03下载
- 积分：1
-
巫魔问题求解，只是一个简单的框架，仅仅有一个很简单的算法...
巫魔问题求解，只是一个简单的框架，仅仅有一个很简单的算法-Wumpus problem solving
- 2022-04-10 08:53:37下载
- 积分：1
-
基于bagging算法的C++程序。
基于bagging算法的C++程序，包括matlab程序的结合。代码简单易懂，适合模式识别的初学者。
- 2022-05-27 17:55:31下载
- 积分：1
-
高性能数值计算库
文件包括了高性能数值计算库PETSC说明文档以及源代码，尤其适合做大规模并行数值计算的朋友们使用。
- 2022-08-20 16:03:54下载
- 积分：1
-
ACM的重要PPT资料,对初学者非常有益处
ACM的重要PPT资料,对初学者非常有益处-ACM important PPT information is very useful for beginners
- 2023-01-02 20:05:12下载
- 积分：1
-
交通仿真（排队论）小程序
This is the project of my course in the USA:
Customers
arrive at a service station (with a single server) according to the Poisson
process with a mean arrival rate of lambda = 0.3 (customers/min). Each customer
waits in queue (if present), proceeds to receive service upon his/her turn, and
departs the system when the service is completed. The service time is uniformly
distributed between 2.5 and 4.5 minutes. On each day, the service station is
open for two hours. Any customers in queue at the end of work hours are served
before closing the service station for the day. Use simulation (do 100
simulation runs) to determine
- 2023-02-02 14:55:04下载
- 积分：1
-
实现数学中的warshall算法，既完成对传递闭包的求解
实现数学中的warshall算法，既完成对传递闭包的求解-To achieve in mathematics warshall algorithm, both to complete the transitive closure of the solution
- 2022-01-21 02:39:12下载
- 积分：1
