登录
首页 » 算法 » better engineering calculation procedures more powerful calculation of the bridg...

better engineering calculation procedures more powerful calculation of the bridg...

于 2022-03-05 发布 文件大小:57.27 kB
0 163
下载积分: 2 下载次数: 1

代码说明:

较好的工程计算程序功能较强 计算桥梁的跨度等-better engineering calculation procedures more powerful calculation of the bridge span, etc.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 3D打印机下位机源码(不完整)以及原理图
    3D打印机下位机源码(不完整)以及原理图,网上看到的,觉得不错,包括下位机各部件的驱动以及原理图
    2022-12-11 18:10:05下载
    积分:1
  • 这是对一维时间序列进行归一化计的matlab程序
    这是对一维时间序列进行归一化计算的matlab程序-This is the one-dimensional time series to a calculation procedure of Matlab
    2023-09-04 18:25:03下载
    积分:1
  • 这个程序是标准的BP神经网络,可以调整输入、输出和隐曾的维数。...
    这个程序是标准的BP神经网络,可以调整输入、输出和隐曾的维数。-this procedure is the standard BP neural network, can be adjusted input, output and has the implicit dimension.
    2023-05-19 21:15:03下载
    积分:1
  • 改进的哲学家问题,用信号和共享内存实现
    改进的哲学家问题,用信号和共享内存实现- The improvement philosopher question, realizes with the signal and the sharing memory
    2022-01-27 15:21:39下载
    积分:1
  • one
    一维搜索程序,我自己编的!大家多多下载,多多支持啊!-one-dimensional search process, I developed! Members can download the generous support ah!
    2022-11-28 14:45:03下载
    积分:1
  • 这是我学习《数值分析》所编写的一个程序,用于线性方程组的雅可比求解。...
    这是我学习《数值分析》所编写的一个程序,用于线性方程组的雅可比求解。-This is my learning "Numerical Analysis" prepared by a procedure for the linear equation for the Jacobian.
    2022-03-06 21:59:04下载
    积分:1
  • FFT 就不用多介绍了 大家都应该清楚,是以后常用的CODE 希望能帮上各位的忙
    FFT 就不用多介绍了 大家都应该清楚,是以后常用的CODE 希望能帮上各位的忙-FFT on the do not have to introduce that we all should be clear, is commonly used after CODE hope you can help on the busy
    2022-01-31 08:40:06下载
    积分: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
  • 目标追踪
    目标追踪算法,自己结合 mean shift + kalman filter,效果还不错,半自动跟踪。毕设要求,结合了最简单的mean shift 算法,以及一个二维卡曼滤波器,实现了目标的实时跟踪监测,效果已经达到要求,在这里分享给大家。
    2022-07-14 22:24:18下载
    积分:1
  • calc大数库,实现了所有的基本大数运功能
    calc大数库,实现了所有的基本大数运算功能-calc library of large numbers, realize all the basic computing functions of large numbers
    2023-01-07 03:15:03下载
    积分:1
  • 696516资源总数
  • 106450会员总数
  • 5今日下载