-
Merge, Insertion, Radix, Heap, Bucket, Quick, Counting排序算法
Merge, Insertion, Radix, Heap, Bucket, Quick, Counting排序算法-Sort Algorithm about Merge, Insertion, Radix, Heap, Bucket, Quick, Counting
- 2022-01-30 11:22:27下载
- 积分：1
-
动态规划的投资问题，c++方法，可参考，试过能用
动态规划的投资问题，c++方法，可参考，试过能用-Dynamic programming of investment issues, c++ Way of reference, never use
- 2023-05-15 13:35:02下载
- 积分：1
-
无线传感器网络
在无线传感器网络中，自私节点为了节省能量而拒绝转发其他节点的数据包
- 2022-05-15 23:51:01下载
- 积分：1
-
This is a program that generate a universe of chromas females and males, crosses...
This a program that generate a universe of chromas females and males, crosses men with women and makes the best chromosome of generation-This is a program that generate a universe of chromas females and males, crosses men with women and makes the best chromosome of generation
- 2022-11-11 12:50:03下载
- 积分：1
-
粒子群优化算法
这是PSO算法功能，给每一位想要轻松地学习。此功能有许多选项，给你更好的和最佳的输出。
- 2022-11-24 07:40:02下载
- 积分：1
-
逐次超松弛迭代法（逐次超松弛法，…
逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.
- 2022-03-31 14:51:19下载
- 积分：1
-
A star算法类的C++语言实现
A star算法类的C++语言实现-algorithm category C Language
- 2022-10-11 18:50:03下载
- 积分：1
-
vehicle refueling will issue the restrictions many! I would like to think of onl...
汽车加油行驶问题 这个问题限制条件很多！我想了两天才想出一个动态规划程序！已经经过测试，是正确的！-vehicle refueling will issue the restrictions many! I would like to think of only two days a dynamic planning process! Have been tested, is correct!
- 2022-11-23 06:30:03下载
- 积分：1
-
A Genetic Algorithms and the Traveling Salesman Problem
A Genetic Algorithms and the Traveling Salesman Problem
- 2023-04-09 05:45:03下载
- 积分：1
-
病态方程组的运算
病态方程组的运算-CSM Group Operational
- 2023-07-13 00:45:02下载
- 积分：1
