集合覆盖 meaning in Chinese
set covering
Examples
- Randomized approximation algorithm for weighted set cover problem
带权集合覆盖问题的一种随机近似算法 - The optimization quality and computation time of set covering arid tabu search algorithms were analyzed and compared
摘要分析和比较了集合覆盖和禁忌搜索两种高效布局算法的优化性能和计算时间。 - Based on the result , a novel wideband code division multiple ( wcdma ) cell planning algorithm was proposed , which uses the set covering for overall planning and applies the tabu search for further local optimization
在此基础上提出了一种新的wcdma基站布局算法，该算法使用集合覆盖进行整体布局，使用禁忌搜索进行局部优化。 - Since the novel algorithm makes good use of both the efficiency of the set covering and accuracy of the tabu search , in real instance , it achieves better performance than tabu search algorithm with only 8 . 8 % of its computation time
由于综合利用了集合覆盖算法的快速性和禁忌搜索算法的精确性，实际场景仿真结果显示，新算法仅用禁忌搜索算法8 . 8 %的计算时间，就搜索到比禁忌搜索算法优化性能更好的布局配置。 - In this paper , based on dynamic fuzzy logic , we proposed a mutil - agent coordinate work model in antagonistic environment and non - antagonistic environment in dealing with the mutil - agent system ' s work mechanism . and out ' s works include five respects as follows : ( 1 ) based on the principle of yielding , we gave the algorithm to resolve conflicts among agents . ( 2 ) based on the concept of set cover , we gave a generic algorithm to distribute the resource among agents
本文基于动态模糊逻辑理论，针对多agent系统中在对抗和非对抗环境中的工作机理，建立了多agent基于对抗和非对抗环境的协调工作模型，主要包括如下几个方面的工作： ( 1 )基于让步原则，给出了多agent的冲突消解算法； ( 2 )基于集合覆盖的概念，给出了多agent的资源分配通用算法( 3 )基于动态模糊逻辑，分析了当前agent的bdi模型的不足，并针对这些不足，给出了基于dfl的agent的心智模型。