Our solution was to come up an algorithm (protocol) to accommodate a first and second failure of application (or nodes) within the highly available cluster.
我们的解决方案将采用一种算法（协议）来适应高可用性集群中应用程序（或节点）的第一次和第二次故障。
With the back-propagation algorithm in hand, we can turn to our puzzle of identifying the language of source code samples.
在掌握了反向传播算法后，可以来看我们的识别源代码样本语言的难题。
Kanerva's memory algorithm could do several marvelous things that parallel what our own minds can do.
卡内尔瓦的记忆算法能做一些可媲美于人类思维的不可思议的事情。
It sends information up to our server, and our server does this global matching algorithm to figure out which two phones in the world got the same bump at the same time in the same place.
它会将信息传输到我们的服务器上，我们的服务器通过全球匹配运算系统，确定是哪两个手机，在同一时间，同一地点，同时撞击。
Our first job is to obtain a KeyManagerFactory, but to do this we need to know which algorithm to use.
首要工作是获取KeyManagerFactory，但是要这样做，我们需要知道将使用哪种算法。
Implementing and executing this algorithm using our libraries produced the following results.
使用我们的库来实现并执行这个算法产生以下结果。
Finally, we want to adjust the attributes of our cluster algorithm by clicking SimpleKMeans (not the best UI design here, but go with it).
最后，我们想要通过单击SimpleKMeans调整我们群集算法的属性(虽然不是最佳的UI设计，但还是先接受吧)。
It is not our invention, the algorithm was invented by a very smart engineer at Intel.
这不是我们的发明，发明该算法由一个非常聪明的工程师在英特尔。
Our study is one of the first to develop a risk algorithm for just this purpose.
我们的研究是第一个制定一个风险算法只是这一目的。
Our algorithm is easier to realize, and can be used in many information service systems, such as search engine.
本论文中的算法实现较简单，可以应用到目前的一些信息服务系统中，如搜索引擎等。
Our simulation results show that compared with Direct Diffusion (DD) algorithm, RRPS achieves lower delay for real-time (RT) traffic, and exhibits substantially longer network lifetime.
实验结果表明，与直接扩散路由算法相比，RRPS能降低实时业务的端对端延时和延时抖动，并提高网络生存期。
In this paper, all of our work surrounds the applications of immune algorithm in cellular wireless location.
本论文的所有工作都是围绕着免疫算法在蜂窝网无线定位技术中的应用展开的。
Notice that the compile method includes the optimization specified by Step 2 of our algorithm.
注意，compile方法包括算法的第2步所指定的优化过程。
Hi, our algorithm knows your career dreams!
嗨，我们的算法能预测到你的职业梦想！
Rotary coordinates are dynamically established in our matching algorithm, in which an elastic minutiae paring method is used.
特征点匹配算法通过动态建立极坐标系和弹性配对特征点来实现。
Experimental results show that our algorithm has a better performance on network lifetime than the common clustering algorithms.
实验结果表明，新算法较常见分簇算法更能够延长网络寿命。
Experimental results show that the complexity of our proposed algorithm is much less than that of the cascaded decode-encoder scheme, while the quality of video almost keeps the same.
试验结果表明：该算法在获得与级联解码器-下采样-编码器几乎一致的视频质量情况下，大大地降低了计算复杂度。
In our experiment system, we adopted a path length constrain to touch up the original motion path editing algorithm.
本文提出了增加路径长度的约束的方法，并在我们的实验系统中加以实现。
The proposed algorithm is then compared with the commonly used DR algorithm, and we show that our algorithm is very effective.
最后，将提出的这种自适应DR算法与普通DR算法进行了比较研究。
Experiments on UCI data sets show that compared with traditional methods our algorithm can get more accurate rules in a shorter time.
UCI数据库上的实验结果表明，与传统方法相比该算法能够在更短的时间内得到分类精度更高的规则。
Simulation results showed our algorithm could predict the partition time much more accurately than the conventional ones.
模拟结果也证明我们的算法更为精准。
By default, including all of our testing, all content transferred from the Rational Requirements Composer server to client connections USES HTTP compression, the gzip compression algorithm.
默认条件下，包括了所有我们进行的测试，所有的内容都会从RationalRequirementsComposer服务器转移到使用HTTP压缩的客户端连接上面，HTTP压缩也就是gzip压缩规则。
Our algorithm can not only recognize objects of different shape but also distinguish between objects that are of the same shape but their sizes proportions are different.
该匹配算法能识别不同形状的目标，而且还可以区分形状相同但大小、比例不同的目标。
Objective To evaluate the value of four neighborhood pixels algorithm designed by our lab, in the distinguishing fatty liver from normal liver.
目的通过临床实验检验自行设计的四邻接点算法在区分正常肝与脂肪肝超声纹理中的价值。
This makes it possible for the extension of our algorithm to multiple-output combinational network and even sequential network.
这为进一步将该算法拓展至实际的多输出组合网络乃至同步时序网络打下了基础。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
It represents the "strength" level of the word, figured out by our algorithm.
它代表相应单词的“强度”等级，是根据我们的算法得出的。
It represents the "strength" level of the word, figured out by our algorithm.
它代表相应单词的“强度”等级，是根据我们的算法得出的。
应用推荐