登录
首页 » Visual C++ » sgl_lib

sgl_lib

于 2010-09-11 发布 文件大小:239KB
0 484
下载积分: 1 下载次数: 5

代码说明:

  VC与matlab混合编程方面的书籍,介绍全面,适用,是一本不错的书(英文)(VC and matlab mixing programming books, introduced comprehensively, applicable, is a good book (English))

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

发表评论

0 个回复

  • FISH
    多仿生机器鱼路径规划 仿真程序 matlab例程和VC程序(matlab for robotic ,vc program)
    2012-04-26 16:05:02下载
    积分:1
  • amlProgramDesign
    一本介绍aml编程设计的书籍.比较基础,实用.(aml introduced a program designed books. Basis for comparison and practical.)
    2007-01-15 11:59:42下载
    积分:1
  • xiangweifacejiao
    关于雷达相位法测角的论文:MUSIC,多基线相位测角法(Phase angle measured on radar papers: MUSIC, multi-baseline phase angle measurement method)
    2014-08-31 11:25:20下载
    积分:1
  • kaerman
    用matlab 作卡尔曼滤波实验。讲解的步骤清楚,简单易懂(ka er man lv bo)
    2015-04-20 20:35:02下载
    积分:1
  • VC-and-matlab
    这里介绍了VC与matlab的简单联合运用,初步学会结合(Here are the simple joint use of the VC and Matlab, initially learned to combine)
    2012-05-21 18:53:08下载
    积分:1
  • ka_zhuliu_sita
    利用基尔霍夫(KA)驻留相位近似求解粗糙面散射系数(Use the Kirchhoff (KA) stationary phase approximation solution of rough surface scattering coefficient)
    2014-11-27 11:31:44下载
    积分:1
  • svmtrain
    支持向量机点点滴滴matlab版,内容不错较为新颖 有很强的实用价值(More novel support vector machine bit by bit matlab version has a strong practical value)
    2012-10-20 10:13:29下载
    积分:1
  • GA-paper
    这是一篇硕士论文,题目是多目标优化的遗传算法研究(This is a master' s thesis topic is a multi-objective optimization by genetic algorithm)
    2011-05-25 14:32:00下载
    积分:1
  • programming-Windows--fifth
    windows 程序设计 第五版 文字版,程序员经典丛书(Text version of the fifth edition of windows programming, programmers Classic Series)
    2014-02-03 12:16:23下载
    积分:1
  • PSO
    梯度下降法是最早最简单,也是最为常用的最优化方法。梯度下降法实现简单,当目标函数是凸函数时,梯度下降法的解是全局解。一般情况下,其解不保证是全局最优解,梯度下降法的速度也未必是最快的。梯度下降法的优化思想是用当前位置负梯度方向作为搜索方向,因为该方向为当前位置的最快下降方向,所以也被称为是”最速下降法“。最速下降法越接近目标值,步长越小,前进越慢。(The gradient descent method is the earliest and most simple and most commonly used optimization method. The gradient descent method is simple to realize. When the objective function is a convex function, the solution of the gradient descent method is a global solution. In general, the solution is not guaranteed to be the global optimal solution, and the gradient descent method is not necessarily the fastest. The optimization idea of gradient descent method is to use the current position negative gradient direction as the search direction, because the direction is the fastest descending direction of the current position, so it is also called the steepest descent method. The faster the slowest descent approach is closer to the target, the smaller the step, the slower the progress.)
    2018-01-29 21:44:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载