Intelligent hill climbing algorithm (IHCA) is a new way to solve the kinematic inverse solution.
智能登山法是一种新型的运动学逆解求取方法。
Iterative TFIDF algorithm belongs to hill-climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point.
迭代tfidf算法属于爬山算法，初始值的选取对精度影响较大，算法容易收敛到局部最优值。
Local optimum of the permutation-based chromosomes is defined, and a hill-climbing algorithm is proposed to get the local optimum.
定义了基于排列的染色体的局部极值，并以此为基础构造了求极值的爬山算法。
Local optimum of the permutation-based chromosomes is defined, and a hill-climbing algorithm is proposed to get the local optimum.
定义了基于排列的染色体的局部极值，并以此为基础构造了求极值的爬山算法。
应用推荐