英语人>网络例句>combinatorial problem 相关的网络例句
combinatorial problem相关的网络例句

查询词典 combinatorial problem

与 combinatorial problem 相关的网络例句 [注:此内容来源于网络,仅供参考]

The assignment problem is one of combinatorial optimization problems. simulated annealing algorithm can be used to solve assignment problem.

指派问题是组合优化问题中的一种,可用模拟退火算法来解此问题。

Cross Entropy method has recently been proposed as a heuristic method.It shows some simple performance in the process of solving combinatorial optimization problems.This paper makes full use of Cross Entropy method to obtain the best estimator for the max-cut problem which is a standard NP-hard problem in graph graphic theory.

交叉熵方法是近几年发展而来的一种启发式方法,在求解组合优化问题中显示出其简单有效的特点,将运用交叉熵方法寻求图论中一个典型的NP困难问题—最大割问题的最优解。

All of the research results can be widely applied in various aspect of social practice, and provide a good research way and method for combinatorial optimization problem with parameter and inverse symmetric transportation problem, promote the research of network programming design, help to get farther research results, enrich the theory treasury of systems engineering.

这些研究成果可以广泛应用于社会实践的各个方面,并为含参数的组合优化问题的研究、组合优化问题的逆问题的研究提供了一个很好地研究思路和方法,推动了网络规划设计方法的研究工作,有助于取得进一步的研究成果,丰富系统工程理论宝库。

In the optimization problem, the more common is combinatorial optimization problem.

在优化问题中,比较常见的是组合优化问题。

This problem can be modeled as a combinatorial optimization problem as follows.

这一问题可以归结为一个组合优化问题如下。

the container loading problem with wide practical application is a combinatorial optimization problem, and is np-hard problem.

集装箱装载问题是一种有广泛应用背景的组合优化问题,它属于np-hard问题。

QoS multicast routing problem is a nonlinear combinatorial optimization problem,which has been proved that the problem is NP-complete problems.

QoS组播路由问题是一个非线性的组合优化问题,已证明了该问题是NP完全问题。

It is known that a production sequencing problem in mixed-model assembly line falls into NP-hard class of combinatorial optimization problem and thus a large-sized problem may be computationally intractable.

本文应用一种解大规模组合优化问题,特别是NP完全组合优化问题的有效近似算法——模拟退火算法,来求解混流生产线的投产排序问题,克服了上述缺点。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。

The traveling agent problem is a complex combinatorial optimization problem.Ant colony algorithm suits to solve nondeterministic polynomial problem,as it is a new evolutionary algorithm,has the characteristics of parallelism,positive feedback and heuristic search.

旅行Agent问题是复杂的组合优化问题,蚁群算法作为一种新的生物进化算法,具有并行、正反馈和启发式搜索等特点,适合求解NP难问题。

第3/9页 首页 < 1 2 3 4 5 6 7 8 9 > 尾页
推荐网络例句

Cynanchum Lingtai apricot production in the average weight 65 grams, the brightly-colored fruit, juicy rich, sweet-sour taste, sweet from the nucleolus, when the late Qing Dynasty famous Shaanxi, Gansu provinces, the Qing imperial court Tongzhi tribute for years.

灵台生产的牛心杏平均单果重65克,果实色泽鲜艳,汁多味浓,甜酸适口,离核仁甜,清末时就驰名陕、甘两省,清同治年间曾为朝廷贡品。

Chenopodium album,Solanum nigrum, and Amaranthus retroflexus were very susceptible to the herbicides. Polygonum persicaria and Abutilon theophrasti were relatively less susceptible to the herbicides, and Lycopersicon esculentum was not susceptible to it. The relationship between reduction rates of weed biomass and PPM values of weed leaves 2,4, and 6 days after treatment was established.

供试的6种杂草对该混剂的敏感性存在显著差异:红心藜Chenopodium album、龙葵Solanum nigrum和反枝苋Amaranthus retroflexus对该混剂最敏感,ED90值分别为47.65、71.67和29.17g/hm2;春蓼Polygonum persicaria和苘麻Abutilon theophrasti敏感,ED90值分别为96.91、114.20g/hm2;而番茄不敏感。

However, I have an idea.

不过,我有个主意。