登录
首页 » matlab » ReconocimientoRostros

ReconocimientoRostros

于 2013-08-27 发布 文件大小:1KB
0 277
下载积分: 1 下载次数: 2

代码说明:

  Describe Describe Describe Describe Describe Describe Describe Describe Describe Describe

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

发表评论

0 个回复

  • steep
    一个关于最速法的,matlab程序。经试验,效果很好。(A law on the most speed, matlab program. After testing, the effect is very good.)
    2010-11-22 15:19:58下载
    积分:1
  • OFDM
    This a matlab code that simulate the monte-carlo simulation of using 16-QAM with OFDM system under AWGN case.
    2008-05-21 16:07:52下载
    积分:1
  • 1
    说明:  2BP神经网络的非线性系统建模-非线性函数拟合(bp neural networing)
    2012-03-25 20:42:27下载
    积分:1
  • 222222111
    fuzzy preference rough set based feature evaluation and selection
    2011-09-03 21:05:19下载
    积分:1
  • Artificial-Neural-Networks-The-Tutorial-With-MATL
    This tutorial describes the use of Artificial Neural Networks in Matlab.
    2013-12-10 06:05:19下载
    积分:1
  • dianjifangzhen50li
    包括直流电机,异步电机,同步电机的各种运行状态的仿真。(Including the DC motor, asynchronous motor, synchronous motor simulation of various operating states.)
    2009-09-19 16:25:26下载
    积分:1
  • vqlbg
    Using vqlbg to implement the vq algorithm
    2009-11-17 06:07:19下载
    积分:1
  • fuzzy
    模糊控制matlab程序,利用龙格—库塔法进行系统仿真(Fuzzy control matlab program using the Runge- Kutta method for system simulation )
    2012-04-01 11:57:07下载
    积分:1
  • tsp
    蕞优分组周游路线问题是一类物流智能调度问题,是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后,人们对这一类问题给予了极大的关注并进行了大量的研究,提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大,纯数学方法在允许的时间和空间上都很难找到问题的最优解,于是人们开始转向寻找问题的近似最优解,遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效,但对于有多个限制条件的多目标最优化问题缺显得有点力不从心,很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法,虽然建模条件限制了描述的问题的通用性,有待推广,但它能有效利用问题的领域知识,提高了求解效率,保证了解的可行性和最优性,算法思想极具推广潜力,可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)
    2014-08-18 10:05:55下载
    积分:1
  • Feng_Huang_Wu
    matlab application developed for midi files
    2015-02-22 14:53:00下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载