在此基础上提出基于对方兴趣点的爬山式搜索算法，彻底解决了传统博弈论多属性谈判模型中计算量大而无法实现的问题。
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.
灵活调整网格工作负荷，对随机多起点爬山算法进行了全面评估。
By flexibly adjusting grid workload, the algorithm of random multi-start hill climbing is evaluated comprehensively.
自动对焦的过程就是运用爬山搜索算法求取对焦评价函数最大值的过程。
The procedure of auto-focusing is to getting the maximum of the focusing (evaluation) function employing the mountain-climb searching algorithm.
应用推荐