查询词典 solving process

Ant Colony Algorithm is a new developed bionic optimization algorithm, which simulate the ants'finding food process. Because of its simple mechanism, plus-feedback parallelization, strong lustiness and excellent distributed compu- tational mechanism, it has shown its excellent capability and huge developing potential in solving many complicated optimization problems, and it has been successfully applied to production problem such as scheduling problems and routing problems. But it also has some disadvantages, it need longer searching time than others and tend to precocity and stagnation.

蚁群算法是一种最新发展的模拟昆虫王国中蚂蚁觅食行为的仿生优化算法，该算法采用了正反馈并行自催化机制，具有较强的鲁棒性、优良的分布式计算机制、易于与其它方法结合等优点，在解决许多复杂优化问题方面已经展现出其优异的性能和巨大的发展潜力，并已成功地应用于诸如生产调度、布线等生产问题。

Ant Colony Algorithm is a new developed bionic optimization algorithm,which simulates the ants'finding food process.Because of its simple mechanism,plus-feedback parallelization,strong lustiness and excellent distributed computational mechanism,it has shown huge developing potential in solving many complicated optimization problems.

蚁群算法是一种最新发展的模拟昆虫王国中蚂蚁觅食行为的仿生优化算法，该算法具有较强的鲁棒性、优良的分布式计算机制、易于与其它方法结合等优点。

Computer aided solving of basic function Conceptual design is a mapping process from function domain to physical one.

并在此基础上给出了一个新的复杂运动求解的过程模型—基于状态向量的描述模型。

By applying Markov decision process, three solving methods are elaborated, including steady-state probability, a policy improvement algorithm and dynamic programming.

应用马尔可夫决策过程求解时，阐述了稳态概率、策略改进算法和动态规划三种方法。

The use of greedy algorithm programming, minimum spanning tree problem solving, and gives details of the process!

详细说明：使用贪心算法编程，求解最小生成树问题，并给出详细的过程！

However,To prove Inequality with elementary method,we often create complex computational process. The second ,we will take full advantage of the knowledge of calculus Inquiry Testimony of inequality,and concluded the higher mathematics to prove Inequality several main method and its application conditions.Constructors in the context of the use of the monotone function,Calculus value theorem,function and the most extreme value,integral, it can be a very effective solution to the inequality problem proof. At last,we summed up several convenient and simple way to prove Inequality.It will be play a great role in our problem Solving.

但是用初等方法证明往往会造成复杂的运算过程，本文接着充分利用微积分的知识探究不等式的证明方法，并指出微分学和积分学在不等式的证明的具体应用，那就是在构造函数的背景下运用函数的单调性、微积分中值定理、函数的极值和最值、定积分，那么就可以十分有效地解决不等式中的证明问题，从而归纳出几种方便而又简捷的方法，这样对我们解题将会起到很大的作用。

The dynamic programming is a branch that it is multi-stage decision-making process of solving a mathematical optimization method.

动态规划是运筹学的一个分支，它是解决多阶段决策过程最优化的一种数学方法。

After solving the bubble radius change rule, the velocity of the bubble growth and the collapse process is gained using numerical differential coefficient method.

求解出空化泡半径变化规律之后，本文应用数值微分的方法，求出不同初始半径空化泡壁的膨胀和崩溃速度。

This paper is to studies the machine process in common use Z 3040 in inside radial drilling machine electric control system improves problem. The aim is solving device complexity, inferior reliability and stability, malfunction analysis and trouble obviation of the traditional relay electric control system.

本论文是研究机械加工中常用的 Z3040摇臂钻床传统电气控制系统的改造问题，旨在解决传统继电器-接触器电气控制系统存在的线路复杂、可靠性稳定性差、故障诊断和排除困难等难题。

First, for the reduction of the solving scale of the scheduling problem, on the basis of the defined scheduling characteristics—resource conflicting probability, all operations of the scheduling problem are divided dynamically into two kinds in the scheduling process: the first kind of operations with greater probability of the resource conflict, and the second kind of operations with less probability of the resource conflict.

首先，在遗传算法迭代求解过程中，为降低调度问题的求解规模，基于所定义的调度特征量——资源冲突可能性，将所有操作动态划分为资源冲突可能性较高的操作和资源冲突可能性较低的操作，分别直接和间接参与染色体编码。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。