发现基本蚁群优化算法存在慢收敛且易停滞等问题。
The ant colony optimization algorithm has found slow convergence and easy to stagnation.
论述了TCP/IP网络中距离向量(V D)算法中的慢收敛问题,以及一些解决方法的不足。
The thesis describes some solutions for the slow convergence (count to infinite) problem in Vector-Distance algorithm in TCP/IP and points some shortages of them.
分析了BP算法的基本原理,指出了BP算法具有收敛速度慢、易陷入局部极小点等缺陷以及这些缺陷产生的根源。
Then some defects such as slow convergence rate and getting into local minimum in BP algorithm are pointed out, and the root of the defects is presented.
应用推荐