登录
首页 » C++ » C.Algorithms.for.Real._20-_20.time.DSP.1995

C.Algorithms.for.Real._20-_20.time.DSP.1995

于 2009-10-05 发布 文件大小:10055KB
0 145
下载积分: 1 下载次数: 42

代码说明:

  关于模式识别的套资料,包括了 c/matlab程序代码,欢迎大家来下载(With regard to pattern recognition sets of data, including the c/matlab program code, we are happy to download the)

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

发表评论


0 个回复

  • work
    一级倒立摆的一个Simulink仿真模型(An inverted pendulum of a Simulink simulation model)
    2011-10-31 21:55:16下载
    积分:1
  • lpc_comparator
    PHILIPS LPC76X Comparator
    2005-01-31 12:38:06下载
    积分:1
  • BackgroundRemovalforColorImagesBasedonColorCompone
    说明:  基于彩色成分差异的彩色图像背景去除算法研究(Background Removal for Color Images Based on Color Components Difference0)
    2010-03-26 17:59:34下载
    积分:1
  • gold-code-31
    此列程序产生31位gold码,平衡gold码,是由m序列优选对生成(This column procedure produced 31 gold code, balancing the gold code is generated by the m sequence)
    2012-04-07 19:37:06下载
    积分:1
  • image-segment
    这是用ELM(极限学习机)做的关于图像识别的分类实验,有数据,有程序,有训练时间,测试时间和精度(It is used ELM (Extreme Learning Machine) to do experiments on the classification of image recognition, has data, procedures, training time, test time and accuracy)
    2014-10-24 22:00:14下载
    积分:1
  • freeselectmarker
    本程序的功能是实现人为框定目标后,对目标进行灰度边缘的提取和标记。(gray scale image,edge detected.)
    2009-03-09 14:49:24下载
    积分: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
  • MATLAB-Builder-for-Java-Programming
    MATLAB Builder for Java混合编程开发手册(MATLAB Builder for Java Programming Guide mixing)
    2011-10-31 21:58:51下载
    积分:1
  • 9160122010
    tangent bug is usefull for use it
    2013-10-08 22:20:58下载
    积分:1
  • 一个bp的逼近算法-my1
    一个bp的逼近算法(an approximation algorithm bp)
    2005-02-28 09:24:54下载
    积分:1
  • 696518资源总数
  • 104744会员总数
  • 33今日下载