搜索资源列表
YSPSO
- 带压缩因子的粒子群算法,有效控制粒子的飞行速度使算法达到全局探测与局部开采两者间的有效平衡-With a compression factor of the particle swarm algorithm, effective control of the particle speed to make the algorithm reach the global exploration and local exploitation of an effective balance between
05363793
- An Improved PSO Algorithm to Optimize BP Neural Network Abstract This paper presents a new BP neural network algorithm which is based on an improved particle swarm optimization (PSO) algorithm. The improved PSO (which is called IPSO) algori
wendudiaojie
- 用全局变量和局部变量实现温度的调节及显示功能-With the realization of global variables and local variables, and display temperature regulation
WCDMA
- 本文首先提出了基于接收信干比的局部和全局算法,在次基础上提出了一种自适应接纳门限算法,其基本出发点是在保证系统中断性能的前提下,尽可能降低系统阻塞概率,充分利用系统容量资源。-This paper proposes received signal to interference ratio based on the local and global algorithms, based on the second admission, an adaptive threshold algorithm
Parallel-genetic-algorithm
- 经典遗传算法利用单一种群对种群个体进行交叉、变异和选择操作,在进化过程中的超级个体易产生过早收敛现象,粗粒度并行遗传算法利用多个子种群进行进化计算,各子群体分别独立进行遗传操作,相互交换最优个体后继续进化。该文证明了该算法的搜索过程是一个有限时齐遍历马尔柯夫链,给出粗粒度并行遗传算法全局最优收敛性证明。对于旅行商问题TSP利用粗粒度并行遗传算法进行了求解,以解决经典遗传算法的收敛到局部最优值问题。仿真结果表明,算法的收敛性能优于经典遗传算法。-Classic genetic algorithm
TSP
- 1 以10/30个结点的TSP问题为例,用遗传算法加以求解; 2 掌握遗传算法的基本原理、各个遗传操作和算法步骤; 3 能求出问题最优解,若得不出最优解,请分析原因; 4 要求界面显示每次迭代求出的局部最优解和最终求出的全局最优解。-For example, 1 to 10/30 junction TSP problem with a genetic algorithm to solve 2 mastered the basic principles of the gene
test1
- (1) 编写程序实现对mian函数参数的解析 参数1表示运算类型(1:加法,2:减法,3:乘法,4:除法,5:求余数) 参数2、3分别表示两个运算数 (2) 分别用局部变量、全局变量、静态变量来接受解析出来的三个参数,并打印它们的地址、大小、以及存储的值;分析局部变量、全局变量以及静态变量存储的空间位置,和暂用空间的大小 -(1) preparation program analysis mian function param
global2local_ang
- 三维坐标变换欧拉旋转变换 全局坐标系下的角度和本地坐标系下角度的欧拉旋转变换-Euler rotation transformation of the three-dimensional coordinate transformation Euler rotation transform the point of view of the global coordinate system and the local coordinate system point of view
lab1.tar
- write some function with logical sign-ou will provide your solution to the Data Lab by editing the collection of functions in this source file. CODING RULES: Replace the "return" statement in each function with one or more lines of
PSO
- 粒子群算法matlab代码,可运行,能找到函数的局部最值和全局最值。-Particle swarm algorithm matlab code, can run, the value of the value of local and global can find function.
DE-demo
- 微分进化算法是一种非常重要的参数寻有选择算法,可以有效的选择一些控制算法参数。-The differential evolution algorithm to search the global optimal solution of the stochastic optimization algorithm is an analog of the natural biological evolution. Because the differential evolution
glcmaa1
- 标准的GLCM纹理分析往往没有得到好的结果,除非大量使用全局类(使用大量的类,带来其他问题)。使用本地类可以帮助,但结果对噪声很敏感。本程序采用加权区域采样大大提高全局和局部灰度共生矩阵纹理分析的结果。-Standard GLCM texture analysis is often not good , except for a large number of global classes (which use a large number of classes to bring other p
Mobile-robot-Location
- 本程序为基于几何地图方式的机器人定位matlab程序,利用地图匹配法定位,根据在局部地图中寻找完整线段与特征点,并在全局地图中寻找预制对应的线段-The programming is about the robot location which based the geometry map.this programming is used the method of map_matching ,in means of find the Complete Line Segments (CLS) a
GloVar
- 关于C++中,局部变量和全局变量的一般用法,方便维护管理-For the use of C++ in general, local and global variables, and easy maintenance
yihcuan
- 遗传算法在适应度函数选择不当的情况下有可能收敛于局部最优,而不能达到全局最优。-There may be genetic algorithm fitness function poorly chosen circumstances converge to local optimum, but can not reach the global optimum.
drfi_matlab-master
- Salient object detection via multi-scale local-global superpixel contrast
蛙跳程序
- 蛙跳算法(SFLA)是一种全新的启发式群体进化算法,具有高效的计算性能和优良的全局搜索能力。对混合蛙跳算法的基本原理进行了阐述,针对算法局部更新策略引起的更新操作前后个体空间位置变化较大,降低收敛速度这一问题,提出了一种基于阈值选择策略的改进蛙跳算法。通过不满足阈值条件的个体分量不予更新的策略,减小了个体空间差异,从而改善了算法的性能。数值实验证明了该改进算法的有效性,并对改进算法的阈值参数进行了率定。(Leapfrog algorithm (SFLA) is a new heuristic p
QuadricHandModel-master
- 这是一个基于openGl制作的一个手势识别程序(This is a 3D hand model developed mainly for vision-based hand motion analysis. The hand model is modeled as a set of rigid quadratic surfaces, and has 27 degrees-of-freedom (DoFs) including 6 DoFs of global motion and 21 DoFs
TS
- 禁忌搜索算法源代码,对局部邻域搜索的一种扩展,搜索过程中采用禁忌准则,即不考虑处于禁忌状态的解,标记对应已搜索的局部最优解的一些对象,在进一步迭代搜索中尽量避开这些对象,避免迂回搜索,从而保证对不同的有效搜索途径的检索,是一种局部极小突跳的全局逐步寻优算法。(Tabu search algorithm source code, an extension of the local neighborhood search criteria, using tabu search process, th
GRP_MCU_53
- Another sure way to decrease code size is to use auto objects rather than global or static local objects. All auto objects within a function are placed within one PIC18 RAM bank and so the bank of these objects can be selected and any PIC18 instru