献[8] 为此提出了一种基于四叉树搜索(Dynamic four-tree search,DFS) 算法的混合搜索(Hybrid query tree, HQT)算法.
基于4个网页-相关网页
本文的一个重点是提出了一种基于网格划分的混合搜索算法。
One emphasis of this paper is to present a hybrid search algorithm based on grid partitioning.
接着进一步提出一种可能的快速混合分形编码的算法，该算法将快速搜索方法、统计规范化、频域比较结合起来。
We further propose a possible fast hybrid fractal encoding algorithm which combines existing fast search methods, statistical normalization and frequency domain comparison.
算例表明，当混沌搜索的次数达到一定数量时，混合优化方法可以保证算法收敛到全局最优解，且计算效率比混沌优化方法有很大提高。
Numerical examples illustrate that the present method possesses both good capability to search global optima and far higher convergence speed than that of chaos optimization method.
应用推荐