• This paper proposes the concept of adjustable loop and tries to make some rudimentary study of the multiple optimum-solution of minimum cost flow.

    本文提出可调概念力图最小费用流问题的多重最优解进行一些探讨

    youdao

  • As multiple sequence alignment problem is an NPC problem, so its optimum solution cannot be obtained because of the time and space limits.

    序列比对问题一个NPC问题,由于时间空间限制能够精确解

    youdao

  • As multiple sequence alignment problem is an NPC problem, so its optimum solution cannot be obtained because of the time and space limits.

    序列比对问题一个NPC问题,由于时间空间限制能够精确解

    youdao

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

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

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