Point covering problem is hard to solve with great actual value.
点覆盖问题是一个重要的有实际意义的难解问题。
This paper discusses the point covering problem solved by ant-algorithm.
文章讨论了点覆盖问题的蚂蚁算法求解。
Full search algorithm searches each point covering the full search window, and too much computation leads to very slow search speed which places great impact on its application.
全搜索算法搜索遍及搜索窗每一个点,计算量太大,搜索速度严重影响了其应用。
应用推荐