-
最新的Levenberg Marquardt 算法。用于非线性最小二乘问题的参数估计和优化!...
最新的Levenberg Marquardt 算法。用于非线性最小二乘问题的参数估计和优化!-Latest Levenberg Marquardt algorithm. Nonlinear least squares problem for parameter estimation and optimization!
- 2022-02-03 14:22:20下载
- 积分:1
-
很有用的算法哦。这是我好不容易找道的
很有用的算法哦。这是我好不容易找道的-useful algorithm oh. This is not easy to find the Road
- 2023-03-23 09:00:03下载
- 积分:1
-
计算器
计算器- Calculator
- 2023-09-06 08:35:03下载
- 积分:1
-
计算理论的经典算法,将确定型有穷自动机最简化,根据等价类的算法用vc实现化简过程。...
计算理论的经典算法,将确定型有穷自动机最简化,根据等价类的算法用vc实现化简过程。-classical theory calculation algorithm, will determine type DFA most simplified, according to the algorithm equivalence classes with vc achieve simplification process.
- 2022-05-24 06:24:10下载
- 积分:1
-
0 / 1背包问题是一个N P
0 / 1背包问题是一个N P-复杂问题,为了解决该问题,,将用回溯算法解决该问题。既然想选择一个对象的子集,将它们装入背包,以便获得的收益最大,则解空间应组织成子集树的形状(如图1 6 - 2所示)。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法,去找到可获得的最大收益。然后,对该算法加以改进,形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
- 2022-02-26 09:06:08下载
- 积分:1
-
c#实现A*算法
采用C#软件,在vs平台上,实现8数码的演示。可以实现自动和手动的功能,功能基本和浙江工业大学的人工智能软件类似。
- 2022-03-04 05:48:57下载
- 积分:1
-
crc数据校验算法
crc数据校验算法-crc data check algorithm
- 2022-04-16 20:38:29下载
- 积分:1
-
维特比译码
维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码维特比译码
- 2022-11-20 20:40:03下载
- 积分:1
-
Fortran科学计算程序,计算原子间力的大小,能级分布
Fortran科学计算程序,计算原子间力的大小,能级分布-Fortran scientific computing procedures, calculation of inter-atomic force size, level distribution
- 2022-08-24 15:49:45下载
- 积分:1
-
odd N bands Demon Lineup : N
奇数N 阶魔方阵问题: 奇数N 阶魔方阵的构造规则如下: 1、在第一行的正中间填入1; 2、如果左上角能够移动,则往左上角填入后继的数;如果左上角不 能移动,则顺移到该列最下方左边的一列中最靠近该列的位置; 3、如果左上角不能移动,同时在该列位置的最下方左边最靠近的位 置处也不能填入数,则往该位置的上一行的最右边的位置处填入 后继数; 4、每次尽可能地往左上角填数,如果发现左上角已经填满了数,则 从当前填的数的位置下方填上后继数。 要求: 无。 输入: 用户从键盘任意输入一个正奇数。 输出: 打印出该魔方阵。-odd N bands Demon Lineup : N-odd magic Lineup Construction Rules are as follows : 1, the first line is the middle of a preference; Two, if the upper left corner to Mobile, the successor to fill in the upper left; If the upper left corner, unable to move, with the move out of the bottom of the left one of the closest out of position; three, if the upper left corner, unable to move, while in the position shown in the bottom left nearest location Department has not entered a few, to the position of the party on the right side of the positions filled successor; 4, each possible to fill the upper left corner, if fill the upper left corner, has found a few, from the current fill several positions to fill in the bottom subsequent few. Requ
- 2022-01-21 19:39:47下载
- 积分:1