OR映射是一个需要穷举测试覆盖的主要层。
The or mapping is a major layer that needs exhaustive test coverage.
现在，我们上次，看过穷举法解决方案。
Now, what we saw last time is there's a brute force solution.
同时利用穷举法对配煤进行优化选取。
At the same time, the use of coal exhaustive method to optimize selection.
通过穷举计算，我们观察到了这种折叠行为。
By exhaustive enumeration, we get the prion-like behavior of protein folding.
用脑力激荡法穷举可能的失败条件与替代路径成功条件。
Brainstorm and list possible failure conditions and alternate success conditions.
板材的最优切割算法是一种穷举搜索寻求最优解的算法。
The best partition algorithm of board is an algorithm of seeking the best result with infinite search.
采用随机算法，增加算法的复杂度，降低穷举攻击的可能性。
It makes use of the algorithm at random, increases the complexity of algorithm, decreases the possibility of guessing attack.
穷举搜索天线选择算法的计算复杂度随天线的增多变大，影响实际应用。
The antenna selection algorithm is the exhaustive search method. Its computational complexity grows rapidly as the number of antennas increases. It is quite impractical.
然后分别采用边际分析法及穷举法，确定不考虑及考虑可靠性条件的最优化。
Then, it took marginal analytical method and utter citing method to evaluate optimization in the condition of calculating reliability.
此外还分析了当对嵌有水印的作品进行穷举搜索攻击和减法攻击时算法的鲁棒性。
Moreover we analyze its robustness when exhaustive search and subtraction attack are inflicted on the watermarked content.
在定量的构效关系研究中，多重回归分析选人的参数，多是用穷举所有方程实现的。
You can carry out different types of robust regression analysis when your data are not suitable for conventional multiple regression analysis.
解决这些问题的传统方法多采用解析法和穷举法，但这些方法都存在不同程度的缺点。
Analysis method and enumeration method are adopted to solve these problems traditionally, yet they have different defects in some aspects.
笔者不认为，缓存是一个好的、永久的搜索处理方式，但很显然穷举搜索的成本又太高。
I cannot imagine anyone thinks that caching is a good idea and a permanent solution to search. And clearly brute force hits are too expensive.
从理论上讲，使用穷举法不但可以求解tsp问题，而且还可以求出该问题的最优解。
Theoretically speaking, the enumeration not only can solve TSP problem but also can get the best answer.
本文针对配方施肥过程给出的养分用量，提出一种从市场上优选肥料的计算机穷举算法。
Aiming at nutrient prescription given in the process of prescription fertilization, this paper presents an exhaustive algorithm by computer to select the best fertilizer from market.
根据正交校验矩阵的特点，提出了一种一般线性分组码的正交校验矩阵的穷举搜索算法。
According to the characteristics of orthogonal parity-check matrixes, an exhaustive algorithm was proposed to search for the orthogonal parity-check matrixes of general block codes.
从理论上讲，穷举法不但可以保证TSP问题有解，而且还可以最终得出该问题的最优解。
Theoretically speaking, the enumeration not only can solve TSP, but also can get the best answer.
算法不仅对穷举猜测工作具有指导意义，对穷举猜测软件、字典工具软件的开发均有所启示。
The shrink algorithm not only has direction meaning for brute force, but also avail in exploiture dictionary software and the brute force guess software.
但是对现有的计算机来说，使用穷举法在如此庞大的搜索空间中寻求最优解，几乎是不可能的。
But to all computers nowadays, it's hardly to obtain its best answer in such huge researching space by using common enumeration.
穷举法是根据各个自变量所有可能取值相对应的函数值(输出值)寻找参数特征的一种分析方法。
Exhaustive method is an analysis method that looks for parameter property according to all obtainable corresponding function values (output values) for various independent variables.
没有人确切的知道卡斯帕罗的大脑如何运转，但可以确定的是他并不像电脑那样穷举所有的选择。
No one is quite sure how Mr Kasparov's processor operates but it certainly does not do that.
DES作为传统分组密码算法的典型代表，存在密钥空间太小的致命弱点，在穷举密钥攻击下被破译。
As the representative of tradition block encryption algorithm, DES has a deadly weakness that is too small key space to prevent exhaust attacks.
考虑到大量的输入属性可能导致复杂的BPNN，研究了用启发式方法和并行穷举方法约简属性的方法。
As complex information system usually contains large amount of attributes which can be used as the input variables of a model, it may bring about constructing a complicated BPNN.
然而，看看可行的、首选的航班数量如此之多时，我们应该认识到不要再用穷举搜索法对每一次查询进行验证。
However looking at the total number of possible flights to ones that are viable and preferable should start to eliminate the need to apply Brute Force searching to every single query.
通过采用线性加权法、分离部分控制变量法，以及在一定范围内穷举，将问题简化，进而给出模型的求解方法。
We simplify the problems by using the linear weighted method, separate technique of partial control variables, and enumerating in certain range, then give out the solving plan of the model.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
应用推荐