爬山算法 meaning in Chinese
hill climbing
hill-climbing algorithm
Examples
- 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算法属于爬山算法，初始值的选取对精度影响较大，算法容易收敛到局部最优值。 - Enforced hill - climbing with backtracks can use the last searching results when enforced hill - climbing fails , so it is more fit for ff . helpful action ordering can save the time used by enforce hill - climbing through ordering the helpful actions
带有回溯的加强爬山算法在加强爬山算法失败时,通过回溯使规划器可以利用前一步的搜索结果来继续进行加强爬山搜索。