查询词典 algorithms

Genetic algorithm and three kinds of hybrid genetic algorithms are presented for parallel machines earliness/tardiness production line scheduling problem.

三。对并行机器生产线提前／拖后调度问题提出了遗传算法和三种混合遗传算法（基于进化交叉的遗传算法、基于模拟退火的遗传算法、基于进化交叉及模拟退火的遗传算法）。

Finally, the algorithm is validated by an investment example. And the experiment results indicate that our algorithm has better searching ability and can avoid the occurring of earliness effectively. Compared with the traditional GA algorithms, our method converges faster and has better solving precision. To investors, it's a better tool for decision-making.

实验结果表明本文算法不仅具有较强的搜索能力，而且避免了早熟现象的发生，相比于传统的遗传算法具有更高的求解精度和更快的收敛速度，可以为投资者提供更好的决策参考。

There are many algorithms of earthwork calculation .

土方量计算有多种算法。

In the cipher algorithm, IDEA and ECC are algorithms with higher security.

在加密算法中，IDEA和ECC是安全性较高的加密算法。

Two famous algorithms Eclat and Diffset were focused and studied.

实验表明Eclat~+的计算性能优于Eclat和FP-Growth算法。

It is proved in theory that with the introduction of item constraints, Eclat+ could greatly improve the efficiency and speed of association rule mining, and the Eclat+ is compared with some other related algorithms.

通常这些规则中仅有很小的一部分是用户所关心的，因此泛泛的挖掘既降低了算法的运行速度也使挖掘结果失去了核心。Zaki提出的 Eclat[4]算法利用垂直的数据库结构，并利用基于前缀的等价关系将搜索空间划

First, the two association rule algorithms Eclat and Eclat+ are compared. Eclat+ is not as good as Eclat when mining long patterns in large dataset.

首先，深入分析了频繁模式挖掘算法Eclat和Eclat+，在大数据集上挖掘长模式时，Eclat+的性能不及Eclat。

In view of the existing algorithm that is unable to take better account of the network connectivity and the attributes of individual nodes comprehensively, the limitation of the typical algorithms of agglomerative and divisive clustering was analyzed, thus defining conceptually the edge loading, edge weight, connectivity threshold and graph segmentation.

由于当前的算法不能很好地将网络的联通性和单个节点的属性综合考虑，分析了凝聚和分裂层次聚类经典算法的局限性，从而给出边的载荷、边的权重、连接度门限、图形分割等定义。

As the basis of studying detector generation in EDS, several new algorithms are presented.

对负选择检测模型初始检测器集生成算法进行了深入的研究，提出新的生成算法。

Seeking fast theoretical convergence and effective algorithms in unconstrained optimization is a very interested research topic for the optimization specialists and engineers.

对于非线性优化问题寻找快速有效的算法一直是优化专家们研究的热门方向之一。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。