...需要的时间随问题规模呈指数增长,因此诞生了各种启发式算法来退而求其次寻找次优解,是一种近似算法(Approximate algorithms),以时间换精度的思想。局部搜索就是其中的一种方法。
基于68个网页-相关网页
All the major types of reconstruction approaches are discussed, including exact algorithms, approximate algorithms, and iterative algorithms.
文中涉及各种主要重建算,法包括准确重建,近似重建和迭代重建算法。
It is pointed out that valuable approximate algorithms can be obtained for large Numbers of NP hard problems by following the quasi-physical procedure.
这种拟物的方案可为许多NP难度的问题得出有价值的近似算法。
The precise and approximate algorithms solving 0-1 knapsack problem, precise algorithm could not be used to solve 0-1 knapsack problem in a short time, so it could not be applied extensively.
求解0 - 1背包问题的精确算法不能在较短时间内求解大规模0 - 1背包问题,使其实用性受到限制。
应用推荐