• 半边及其结合性表示各种局部约束,将机器可选制造单元设计问题转化基于半边组合优化问题,即计划路径可选的半边图划分问题

    Half edge and its assembly can represent various constraints, Machine redundant manufacturing cell design convert to a combination optimal problem based on half edge g…

    youdao

  • 方法保留边缘避免了以往象分类中出现的边缘模糊问题有效地象进行了区域划分

    This method not only preserves the edge of the image, avoids the problem of edge blurring in image classification, but also is effective in region division.

    youdao

  • 接着一特殊指派问题有向无回路表示出来,从而使指派问题的求解转化为求解有无回路划分问题

    Then the assignment problem is illustrated with the directed acyclic graphs. The assignment problem becomes the partition problem of directed acyclic graphs.

    youdao

  • 再次由于社区挖掘技术能够解决以往社区边界模糊问题使得所挖掘社区唯一,所以可以把该技术应用划分问题上。

    Thirdly, because the Web community mining technology can overcome the ambiguous boundary problem and make the community mined unique, the technology can be applied into the partitioning of the graph.

    youdao

  • 建立了配电网络重构的多划分模型,提出了基于划分算法,用于求解大规模配电网络的馈线间重构问题

    This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem.

    youdao

  • 根据从接收节点得到反馈信息,提出了一个模型来刻画基于网络编码的问题发送节点的重传策略模型化为中的最小划分

    The algorithm converts surface matching problem into maximum weight clique searching problem in graph theory, and the optimal point correspondence set is represented by the maximum weight clique.

    youdao

  • 表示电路转化带权值无向从而电路二等分问题转化成划分问题

    The hypergraph denoting circuit is transformed into a weighted undirected graph, so the problem of circuit bisection is transformed into the graph partition problem.

    youdao

  • 七号信令网拓扑优化存在高级信令转接点(HSTP)A/B平面划分问题归纳一类新的划分问题

    There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem.

    youdao

  • 七号信令网拓扑优化存在高级信令转接点(HSTP)A/B平面划分问题归纳一类新的划分问题

    There is an issue of A/B plane partition of HSTPs in the topology optimization of CCS7 network. It can be formulated into a new kind of graph partition problem.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定