Intelligent hill climbing algorithm (IHCA) is a new way to solve the kinematic inverse solution.
智能登山法是一种新型的运动学逆解求取方法。
On the basis of this model, a "hill climbing" -search algorithm was put forward to solve negotiation models with multi-attribution based on the traditional game theory field.
在此基础上提出基于对方兴趣点的爬山式搜索算法，彻底解决了传统博弈论多属性谈判模型中计算量大而无法实现的问题。
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算法属于爬山算法，初始值的选取对精度影响较大，算法容易收敛到局部最优值。
应用推荐