搜索资源列表
Mixed-leapfrog-algorithm-to-solve-multi-knapsack-p
- 混合蛙跳算法解决多背包问题，此算法是在vs2005下编写，语法为基本的c语言（可以直接复制源码到vc中运行）-Mixed leapfrog algorithm to solve multi-knapsack problem, this algorithm is prepared in vs2005, the syntax for basic c language (can copy the source code to run vc)
fd1d_burgers_leap
- FD1D_BURGERS_LEAP is a FORTRAN90 program which solves the nonviscous time-dependent Burgers equation using finite differences and the leapfrog method. The function u(x,t) is to be solved for in the equation: -FD1D_BURGERS_LEAP is a FORTRAN90 pr
wt
- 病态系统的蛙跳算法，计算量小。首先将非齐次方程的输入量u(t)增广为状态变量，化为齐次方程组。输入量通常为典型输入。-The morbid system leapfrog algorithm to calculate the amount. First, enter the amount of the non-homogeneous equation u (t) is augmented as state variables, Homogeneous equations. The input a
FDTD
- 采用FDTD算法仿真矩型脊波导TM模色散曲线-The finite difference time domain Maxwell equations in the field of time and space differencing. Leapfrog space in the field of electric and magnetic fields alternate calculation, updated by the time field to mimic the changes
Leapfrog
- Leapfrog 法求解一介波动方程，初始条件：c=1m/s,x=1-2时，u=2m/s-Leaapfrog method to solve wave equation
FSFLA
- 蛙跳算法（SFLA）是一种全新的启发式群体进化算法，具有高效的计算性能和优良的全局搜索能力。-Leapfrog algorithm (SFLA) is a new heuristic population evolutionary algorithm, with high computational performance and excellent global search ability.
frog
- 混合蛙跳算法是一种较新的仿生智能算法，大家可以进行改进和算法测试-The hybrid leapfrog algorithm is a newer bionic intelligent algorithm, which can be improved and tested
Creatr_Dual_SW_V1_10
- Firmware for LeapFrog Creatr 30mm
蛙跳程序
- 蛙跳算法（SFLA）是一种全新的启发式群体进化算法，具有高效的计算性能和优良的全局搜索能力。对混合蛙跳算法的基本原理进行了阐述，针对算法局部更新策略引起的更新操作前后个体空间位置变化较大，降低收敛速度这一问题，提出了一种基于阈值选择策略的改进蛙跳算法。通过不满足阈值条件的个体分量不予更新的策略，减小了个体空间差异，从而改善了算法的性能。数值实验证明了该改进算法的有效性，并对改进算法的阈值参数进行了率定。(Leapfrog algorithm (SFLA) is a new heuristic p
Flow_Shop_Scheduling_Problem
- 利用蛙跳算法求解流水车间调度问题，算法上做了相应改进(Using the leapfrog algorithm to solve the flow shop scheduling problem, the algorithm has been improved accordingly.)