搜索资源列表
BP
- 这个学期我学习是神经网络课程,有很多的知识国内都不是很完善,而国外就有很大的进步,下面就是来自一本 <AI for Game>的电子版英文书.其中我就拿用面向对象写的C++类进行说明怎样编写神经网络程序. 神经网络的基本思想就是怎样去改变权值.-This semester my curriculum study are neural networks, there is a lot of internal knowledge is not very perfect, and
jedjjdh
- 人工免疫是对生物免疫系统的工作机理及所具有各种优良特性的模拟。在邮件系统中 引入免疫的思想,构建了一种基于人工免疫的反垃圾邮件模型。 -An artificial immune system studied the principle and some fine features of a biological immune system. The idea of immunologywas adopted to build an anti-trash E-mailmode.l
Bisection
- he basic idea of the method of bisection is to start with an initial interval, [a0,b0], that is chosen so that f(a0)f(b0) < 0. (This guarantees that there is at least one root of the function f(x) within the initial interval.) We then iteratively
genetic
- 理解普通的遗传算法和佳点集遗传算法的基本思想和不同点,用遗传算法测试一标准函数。佳点集算法测试一标准函数,理解普通的遗传算法和佳点集遗传算法的基本思想和不同点-Understanding of the general genetic algorithm and good point set genetic algorithm' s basic idea and the different points, by using genetic algorithms to test a stand
Ho_Kashyap
- Ho—Kashyap线性分类算法(MHKS)采用了支持向量机最大化间隔的思想,利用面向矩阵模式的双边正则化实现线性分类。-Ho-Kashyap linear classification algorithm (MHKS) using support vector machine to maximize the spacing of the idea, using matrix model for bilateral Regularization achieve linear classifica
aaa
- 该程序实现了最小二乘法的算法。基本思想是多元函数求极值所用的方法-Procedures for the implementation of the least squares algorithms. Basic idea is a multi-function for extreme value methods used by
guangdusousuo
- 宽度优先搜索算法(又称广度优先搜索)是最简便的图的搜索算法之一,这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
RepeatFCM
- FCM算法是一种基于划分的聚类算法,它的思想就是使得被划分到同一簇的对象之间相似度最大,而不同簇之间的相似度最小。模糊C均值算法是普通C均值算法的改进,普通C均值算法对于数据的划分是硬性的,而FCM则是一种柔性的模糊划分-FCM algorithm is a clustering algorithm based on the division, which makes the idea is to be divided into clusters with the greatest simila
optimal-decision
- 最优决策——用几个matlab编程的实例阐述分支定界法的思想是:首先确定目标值的上下界-Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds
bicd
- 一个关于最小公倍数的算法,是本人自己编的,不会与别的雷同,同样的算法,但是个人的思路不同。-A least common multiple of the algorithm, are my own, and will not be identical with the other, the same algorithm, but the idea of different individuals.
Binary_Tree
- Binary_tree.cpp :执行文件生成所有二叉树 这样做的目的C + +程序是产生所有二叉树指定节点数目。 基本思想是衍生所有二叉树基于退化树。 该算法的动机是圆括号法则代表二叉树。 一组括号可通过字典秩序排列,由此也可以产生二叉树。但该算法代码中并没有简单地转换括号代表性 它一直在改变过去的节点从最新二叉树下一可能位置(在这里,我们假设右向是正确的退化树方向) 。 该文件还提到计算机内存时(读/写)和avarage参考值。 这个工程在Microsof
devec3
- 微分进化算法DE是1995年由Rainer Storn和Kenneth Price首先提出。DE已被证明在求解过程中具有高效性、收敛性、鲁棒性等优点[5,6] 。它在许多优化问题中都表现出优于自适应模拟退火算法、POS 算法、GA算法的性能。DE利用实数值参数向量作为每一代的种群,它的自参考种群繁殖方案与其他优化算法不同。-DE was first proposed in 1995 by Rainer Storn and Kenneth Price and had been proven tha
GAclassify
- 利用遗传算法对图像进行分类处理,包括遗传的思想和实现,以及在图像方面的应用。-The use of genetic algorithm to classify the image processing, including genetic and realization of the idea, as well as the application of the image.
moyituhuo
- 模拟退火算法的基本思想是从一给定解开始,从邻域中随机产生另一个解,接受Metropolis准则允许目标函数在有限范围内变坏,它由一控制参数t决定,其作用类似于物理过程中的温度T,对于控制参数的每一取值,算法持续进行“产生—判断—接受或舍去”的迭代过程,对应着固体在某一恒定温度下的趋于热平衡的过程,当控制参数逐渐减小并趋于0时,系统越来越趋于平衡态,最后系统状态对应于优化问题的全局最优解,该过程也称为冷却过程,由于固体退火必须缓慢降温,才能使固体在每一温度下都达到热平衡,最终趋于平衡状态,因此控制
secend
- 作业的第二部分 数字信号处理的基本思想rls算法-Operation of the second part of digital signal processing algorithms the basic idea of rls
DCT
- 一个有关DCT的matlab程序,采用分块的思路-DCT-a matlab program, the idea of using block
a
- 基于非负矩阵分解(NMF)的人脸特征提取算法,NMF基本思想是找到一个线性子空间W,使的构成子空间的基本图像的像素点都是正值,而且人脸图像在子空间上的投影系数也是正数-Non-negative Matrix Factorization (NMF) of facial feature extraction algorithm, NMF basic idea is to find a linear sub-space W, so that the composition of sub-space o
theAssemblyLine
- 本程序是麻省理工学院的《算法导论》上的动态规划问题,是由装配线问题引入的,也是我们的一次作业,大家如果交作业的话,也可参考。-This procedure is from the book printed by the Massachusetts Institute of Technology named Introduction to Algorithm on the dynamic programming problem, the problem is introduced by the a
find
- 数据结构中的顺序表和数表的查找算法。基本思想:从表的一端开始,顺序扫描线性表,依次将扫描到的结点的关键字与给定值k进行比较,若相等,则查找成功;若扫描到表的另一端仍没有找到与关键字k相等的结点,则查找失败。-Data structure in the order list and several forms of the search algorithm. The basic idea: to start from one end of the table, the order of the l
LCS
- 用LCS方法解决字符匹配问题,用到动态规划的思想。原创-LCS solution with matching characters, the idea of using dynamic programming