• Artificial intelligence method is very effective in solving the complex combinatorial problems.

    人工智能方法解决复杂组合问题有效方法。

    youdao

  • In order to solve more combinatorial problems, promote the concept grape to the hypergraph is a very natural thing.

    为了解决更多组合问题图的概念推广非常自然的事情

    youdao

  • Many problems in life science or bioinformatics can be translated into combinatorial problems of mathematics and computer science on sequences, trees and stings.

    生命科学中,许多问题可以抽象计算机科学数学关于序列组合问题。

    youdao

  • The purpose of this paper is to sum-up combinatorial auctions -model which based on particular auction market, to study the combinatorial problems from the Angle of commonly model.

    本文的目的就是具体拍卖市场基础建立组合拍卖模型一般模型角度研究组合拍卖问题

    youdao

  • Ant colony system is a novel simulated evolutionary algorithm, which provides a new method for complicated combinatorial optimization problems.

    群算法新型模拟进化算法求解复杂组合优化问题提供了一种新的思路

    youdao

  • In this paper, the polynimial time algorithms of the NP complete problems are gained in the algebraical and combinatorial two aspects respectively.

    本文代数组合两个方面论证NP完全问题存在多项式时间算法

    youdao

  • An adaptive combinatorial optimization algorithm for solving this integrated optimization design problems is put forward.

    针对一体化设计问题求解要求提出了相应的组合优化算法

    youdao

  • The maximum flow problem is one of the classical combinatorial optimization problems.

    大流问题一个经典组合优化问题。

    youdao

  • Due to the high parallelism and recognition ability of the biomolecules in biochemical reactions, biomolecular computing behaves great advantage in solving combinatorial optimization problems.

    由于生物分子化学反应具有高度的并行性识别能力,使生物分子计算解决组合优化问题中显示出巨大的优势

    youdao

  • Branch and Bound algorithm is a general method for solving Combinatorial Optimization Problems. Parallelization is an effective means to improve the algorithm performance.

    分枝限界算法一种求解组合优化问题一般性方法并行化提高算法性能有效手段

    youdao

  • Computation shows that the algorithm is efficient and can be used to solve the complicated combinatorial optimization problems such as machine scheduling.

    计算表明算法具有较高的效率,有效求解机器排序复杂组合优化问题

    youdao

  • The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.

    最大问题组合优化中的一个经典NP -完全问题

    youdao

  • The Algorithm has very wide generality and very good efficiency, its basic principle can widely be used in solving large scale combinatorial optimization problems.

    算法通用性强效率高基本原理广泛应用于求解大规模组合优化问题

    youdao

  • In network graph theory, combinatorial optimum problems, optimum design of network and other related theoretical problems are studied.

    网络研究网络中的组合优化问题、网络优化设计与其相关的一些理论问题。

    youdao

  • The problem of collecting and delivery shunting of non-through wagon flow on the actinoid private line belongs to a kind of the combinatorial optimization problems.

    放射形专用线直达车流问题属于一类组合优化问题,影响因素较多。

    youdao

  • The framework is given for solving combinatorial optimization problems with Line up Competition Algorithm (LCA), and the two principles of determining mutation neighbor region is presented.

    给出列队竞争算法组合优化问题框架确定变异域的条原则

    youdao

  • Job shop scheduling problem is one of the typical combinatorial optimization problems with constraints. To get its encoding has always been one of the main and difficult points of the problem.

    车间作业调度问题一类带有约束典型组合优化问题,目前采用人工鱼群算法解决车间作业调度问题没有检索参考文献。

    youdao

  • The research of the Parallel Immune Algorithm application will help to solve other combinatorial optimization problems.

    并行免疫算法应用研究有助于其他组合优化问题解决

    youdao

  • After lots of experiments ACO has exhibited its excellent performance and efficiency in experiments for solving a great lot of combinatorial optimization problems, and now it is used in many areas.

    大量实验结果表明解决许多组合优化问题表现出较好的求解能力,目前此算法已经得到了比较广泛的应用

    youdao

  • Scheduling is one of the most important combinatorial optimization problems. It is very important in industrial production, manufacturing systems and other fields.

    生产调度一类重要组合优化问题工业生产制造系统领域应用广泛

    youdao

  • Scheduling is an important combinatorial optimization problem. The modern scheduling problems that break through the various assumptions of the classical ones hold out more and more broad prospects.

    排序问题一类重要组合优化问题,现代排序问题突破经典排序问题的种种假设,有着越来越广阔的应用前景。

    youdao

  • In order to solve NP - shop scheduling combinatorial optimization problems, an immune forgotten algorithm for job shop scheduling is proposed.

    为了解决车间调度NP组合优化难题提出了基于免疫遗忘车间调度算法

    youdao

  • The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.

    路径优化问题属于组合优化问题解决组合优化问题一般使用启发式搜索算法

    youdao

  • Aiming at combinatorial optimization problems, this paper carries out the following main research work based on EDA. A hybrid EDA is proposed to solve the multidimensional knapsack problems (MKP).

    本文针对组合优化问题基于分布估计算法主要开展如下研究针对多维背包问题,设计了一种混合分布估计算法

    youdao

  • The design of wireless telecommunications networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems.

    无线通讯网络设计一个复杂过程同时许多困难组合优化问题需要解决

    youdao

  • However, the traditional algorithms have the problems of early convergence or stagnation in the process of combinatorial optimization problems.

    然而,基本蚁群算法求解组合优化问题过程容易出现过早收敛停滞现象。

    youdao

  • However, the traditional algorithms have the problems of early convergence or stagnation in the process of combinatorial optimization problems.

    然而,基本蚁群算法求解组合优化问题过程容易出现过早收敛停滞现象。

    youdao

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

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

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