查询词典 Max

Solar scientists remember the event as the Bastille Day storm: The first major storm of the most recent solar max.

研究太阳的科学家们把巴士底日风暴作为大风暴来记得：最近的太阳峰值的第一主要风暴。

Toyota's team president John Howett made the threat this weekend in Barcelona, as other teams including Ferrari and BMW also openly baulk at the governance of the sport by Max Mosley and his plans for voluntary budget caps.

丰田车队主席约翰豪威特了威胁本周末在巴塞罗那，为其他车队，包括法拉利和宝马汽车公司也公开开球时治理的体育运动莫斯利和他的计划，自愿预算上限。

I'm not going to be convinced of anything until the colormax researchers publish a paper on it.

到color max的研究人员发布相关文件之前，对该镜片的任何特性我都不能确定。

Plot : In 1997, as a US Boss crashes in to Manhattan, during benefaction a life-size max .

阴谋：1997年作为美国老板，坠毁在曼哈顿，在施舍一个真人大小的最大值。

It seems that even Bernie had reached the conclusion that Max was bad for business.

前半段对那些希望了解协和协定来龙去脉的朋友是很大的帮助。

So the best approximation algorithm in this domain,which can draw the mini-max solution of the frequency deviation,is introduced in this paper.

为此，在频率控制领域首次引入了最佳逼近算法，它能给出频率偏差的最小-最大解。

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困难问题—最大割问题的最优解。

At the bifurcation point, the max amplitude of the system varies intensely.

在周期解分叉点上系统的最大振动幅度都发生明显的变化。

By using network flow theory, the optimization problem of power conservation is transformed into the optimal bipartition problem of a flow network which can be partitioned by the max-flow mm-cut algorithm.

利用网络流理论，将节约电量的最优化问题转化为一个流网络的最优分割问题，而后者可采用最大流最小切割算法实现最优切分。

By using network flow theory,the optimization problem of power conservation is transformed into the optimal bipartition problem of a flow network which can be partitioned by the max-flow min-cut algorithm.

利用网络流理论，将节约电量的最优化问题转化为一个流网络的最优分割问题，而后者可采用最大流最小切割算法实现最优切分。

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.

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