网络释义专业释义英英释义
-
集合覆盖 - 引用次数：13
Randomized algorithms for the set cover problem and its variations and duals.
2.集合覆盖问题的各种变体以及其对偶问题的随机算法研究。
参考来源 - 若干组合优化问题的算法研究
·2,447,543篇论文数据，部分数据来源于NoteExpress
Set cover problem
- abstract: The set covering problem (SCP) is a classical question in combinatorics, computer science and complexity theory.
以上来源于: WordNet
双语例句原声例句
-
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
-
Randomized algorithms for the set cover problem and its variations and duals.
集合覆盖问题的各种变体以及其对偶问题的随机算法研究。
-
This thesis proposes a randomized approximation algorithm for the Set Cover problem.
提出了集合覆盖问题的一种随机近似算法。
-
I wanted to say one more thing because I realize that you have to-- your first problem set will cover this-- is to talk about the concept that applies probability theory to Economics.
我还想提一点,因为我意识到...,你们的练习题中会涉及到这个,概率论在经济学中的,应用的问题
应用推荐