-
FUNCTION ESTIMATION WITH NEWTON CLOSE LOOP and ROMBERG METHOD.
FUNCTION ESTIMATION WITH NEWTON CLOSE LOOP and ROMBERG METHOD.-FUNCTION ESTIMATION WITH NEWTON CLOSE LOOP and ROMBERG METHOD.
- 2022-05-16 15:22:24下载
- 积分:1
-
数值分析中的迭代法解线性方程组问题,含输入输出界面。
数值分析中的迭代法解线性方程组问题,含输入输出界面。-Numerical analysis of iterative method for solution of problems of linear equations, including input and output interface.
- 2022-07-21 12:15:31下载
- 积分:1
-
28335产生pwm
基于DSP28335的spwm程序
EVA下面的通用定时器T1工作于连续增/减计数模式,产生三角载波,载波频率为3000Hz,载波比N=60,因此调制波形正弦波的频率为50Hz。本实验中,调制度为
0.8。
预存A相和B相的正弦值列表,C相的可以根据A相和B相的值计算出来
- 2022-12-07 21:00:03下载
- 积分:1
-
机械优化设计的C程序,黄金分割法,解决一维优化问题
机械优化设计的C程序,黄金分割法,解决一维优化问题-Optimal Design of C mechanical procedures, golden section method to solve one-dimensional optimization problem
- 2022-02-12 19:32:17下载
- 积分:1
-
OPENTLD C++ source code
TLD is an algorithm for tracking of unknown objects in unconstrained video streams. The object of interest is defined by a bounding box in a single frame. TLD simultaneously tracks the object, learns its appearance and detects it whenever it appears in the video.
You are allowed to use TLD under the terms of the GPL version 3.0. It means that any distributed project that includes or links any portion of TLD source code has to be released with the source code under the GPL version 3.0 license or later. The details of the license can be found in file LICENSE. If you wish to use this code or any of its part for com
- 2022-06-17 10:16:04下载
- 积分: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#+OPengl实现漫游
应用背景现在大多数全景都是使用html来完成,c/s网上很少 大多数都是C++,大家看看怎么样,下载下来的时候改下资源文件路径关键技术OPengl,C#,opengl.tao,3D,图像处理,算法
- 2023-08-17 00:50:04下载
- 积分:1
-
pso算法解决tsp问题的例子
pso算法解决tsp问题的例子-PSO algorithm to solve the problem of examples tsp
- 2022-04-06 12:24:15下载
- 积分:1
-
矩阵求逆算法程序, c++ 编写
矩阵求逆算法程序, c++ 编写-matrix inversion algorithm, c prepared
- 2022-04-18 21:58:20下载
- 积分:1
-
矢量的快速排序
矢量的快速排序-Quick sort of vector
- 2022-02-26 13:02:48下载
- 积分:1