-
2009
2009
- 2022-03-15 08:15:45下载
- 积分：1
-
已知三维点和三维线的坐标和代表式，求两者间最短距离，用对话框实现，可以提出算法函数单独使用...
已知三维点和三维线的坐标和代表式，求两者间最短距离，用对话框实现，可以提出算法函数单独使用-known three-dimensional and three-dimensional point of the line-coordinates and representatives, for the shortest distance between the two, with dialog to achieve, we can make use of arithmetic functions alone
- 2022-02-22 00:19:10下载
- 积分：1
-
SVM分类点
对一系列数据点进行分类，并且可视化显示，即单独窗口显示进行分类的点以及所得到的的超平面
- 2022-03-20 18:12:14下载
- 积分：1
-
AODV 路由协议，分析节点路由的最佳路径的路径选择
它是使积极路由算法，将使整个输入和输出的过程，特别是提供整个邮件中的特定节点和任何其它节点的 AODV 协议算法给出了估计分析
- 2022-03-11 14:33:57下载
- 积分：1
-
短小精悍的C语言标准函数库。提供450个以上的可移植的算法和工具代码。...
短小精悍的C语言标准函数库。提供450个以上的可移植的算法和工具代码。-terse and forceful language standard C libraries. For more than 450 portable code algorithms and tools.
- 2022-11-16 18:35:03下载
- 积分：1
-
看，是VB程序的数值类型，程序会让你输入一个n。
猜数字，是一个VB数值计算类程序，程序可以让你输入一个数字，猜错了可以继续猜-viewing, VB is a numerical type of proceedings, procedures can let you input a number of wrong guess can continue
- 2022-01-30 16:25:24下载
- 积分：1
-
这个应该是经典编程里面的经典算法实现的八皇后问题．也通过了测试．完全达到设计要求．
这个应该是经典编程里面的经典算法实现的八皇后问题．也通过了测试．完全达到设计要求．-This should be a classic of the classic programming algorithm inside the eight Queen s problems. Also passed the test. Fully meet the design requirements.
- 2022-01-22 07:50:23下载
- 积分：1
-
从头和尾同时进行冒泡排序
从头和尾同时进行冒泡排序-Do bubble sort from the head and from the tail at the same time
- 2022-01-25 18:12:51下载
- 积分：1
-
平均因子分解法应用于正定矩阵
平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies:
(1) U U = X
(2) U is upper triangular (that is, it has all zeros below the diagonal).
It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive
- 2022-10-16 04:30:02下载
- 积分：1
-
Support vector regression machines blind equalization algorithm, which uses the...
支持向量回归机的盲均衡算法，其中使用的是v算法-Support vector regression machines blind equalization algorithm, which uses the algorithm v
- 2022-04-10 20:22:28下载
- 积分：1
