登录
首页 » matlab » yhgj

yhgj

于 2014-12-25 发布 文件大小:59KB
0 411
下载积分: 1 下载次数: 3

代码说明:

  matlab优化工具箱介绍,还提供了线性、非线性最小化,方程求解,曲线拟合,二次规划等问题中大型课题的求解方法(matlab optimization toolbox presentation also provides a linear, nonlinear minimization, equation solving, curve fitting, quadratic programming problems in large-scale problem solving method)

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

发表评论

0 个回复

  • ii
    说明:  matlab测试图片以及脚本,内容不多,比较简洁(matlab test pictures and scripts, the contents of small, relatively simple)
    2010-10-22 20:01:16下载
    积分:1
  • matlabSDK
    说明:  二值图像水印的代码算法matlab实现,还没有完善(Binary image watermarking algorithm matlab code to achieve)
    2010-04-27 10:51:26下载
    积分:1
  • neuralnetworkMatlabprogram
    this a neural network Matlab program.
    2006-08-17 19:54:43下载
    积分:1
  • radiation
    动画技术:电偶极子辐射的动态仿真,影片动画和实时动画。绘制各个时刻的电力线图,即使用contour函数在 t取不同值的情况下绘制电力线方程(Animation techniques: electric dipole radiation dynamic simulation, film animation and real-time animation. Rendering of each hour power line, which USES contour function in the wt take different values of electric draw equations )
    2012-05-09 18:50:35下载
    积分:1
  • gridmat
    grid lab grid mat code for power system analysis
    2014-09-08 04:37:26下载
    积分:1
  • Minic-S.
    DIGITAL STEGANOGRAPHY TECHNOLOGY
    2014-11-21 12:00:41下载
    积分:1
  • MATLAB
    MATLAB 教程---Matlab_陈旻昕讲座,并附三个列子供初学者学习(MATLAB)
    2009-12-25 18:20:56下载
    积分:1
  • FastLaplace
    实现快速贝叶斯算法,先验超参数分布不再使用高斯函数而是用拉普拉斯函数代替(Fast Bayesian algorithm, a priori super-Gaussian parameter distribution is no longer used but with the Laplace function instead)
    2013-10-13 13:49:34下载
    积分:1
  • psofcm
    自己编写的基于惯性权重线性递减策略的粒子群算法优化聚类(My own particle swarm optimization algorithm based on the linear decreasing inertia weight strategy applied to cluster.)
    2020-10-28 17:29:58下载
    积分:1
  • kmeans
    说明:  k均值算法是一种迭代求解的聚类分析算法,其步骤是随机选取K个对象作为初始的聚类中心,然后计算每个对象与各个种子聚类中心之间的距离,把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。(kmeans algorithm is an iterative solution clustering analysis algorithm. First, the initial clustering centers are randomly selected. Then, distance between between each point ans others are calculated, and each data point is designed to its nearest clustering center.)
    2020-06-21 23:40:01下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载