板材的最优切割算法是一种穷举搜索寻求最优解的算法。
The best partition algorithm of board is an algorithm of seeking the best result with infinite search.
其中中间节点法给出了详细的数学证明，穷举搜索法给出了具体的算法。
Middle node law among them give and publish detailed mathematics prove, exhaust and search for law give and produce the concrete algorithm.
穷举搜索天线选择算法的计算复杂度随天线的增多变大，影响实际应用。
The antenna selection algorithm is the exhaustive search method. Its computational complexity grows rapidly as the number of antennas increases. It is quite impractical.
由CPU下穷举搜索的性能较差，引出从软件方面将其并行化的改进方法。
The improvement in software was introduced due to poor CPU performance of the same search, a parallel realization was presented.
此外还分析了当对嵌有水印的作品进行穷举搜索攻击和减法攻击时算法的鲁棒性。
Moreover we analyze its robustness when exhaustive search and subtraction attack are inflicted on the watermarked content.
笔者不认为，缓存是一个好的、永久的搜索处理方式，但很显然穷举搜索的成本又太高。
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.
根据正交校验矩阵的特点，提出了一种一般线性分组码的正交校验矩阵的穷举搜索算法。
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.
然而，看看可行的、首选的航班数量如此之多时，我们应该认识到不要再用穷举搜索法对每一次查询进行验证。
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.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
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.
而格状网络中的RWA是个NP -难问题，它不可能在有限的时间内通过穷举搜索来获得其优化解，为此我们设计了一个启发性算法以解决这个问题。
But the RWA in mesh networks is a NP-hard problem which can not be solved optimally with exhaustive search in the endurable time. Hence, we designed a heuristic algorithm to solve it.
然而，现在无论使用穷举搜索(bruteforce search)还是缓存(discardvs caching)都属于陈旧的思维模式。
However the current dilemma of either brute force search and discard vs caching is dealing in old paradigms of thought.
说明：搜索算法：利用计算机的高性能来有目的的穷举一个问题的部分或所有的可能情况，从而求出问题的解 的一种方法。
Search algorithm: the use of high-performance computers to have the purpose of an issue of exhaustion of some or all of the possible, and thus obtained the solutions of the problem.
但是对现有的计算机来说，使用穷举法在如此庞大的搜索空间中寻求最优解，几乎是不可能的。
But to all computers nowadays, it's hardly to obtain its best answer in such huge researching space by using common enumeration.
但是对现有的计算机来说，使用穷举法在如此庞大的搜索空间中寻求最优解，几乎是不可能的。
But to all computers nowadays, it's hardly to obtain its best answer in such huge researching space by using common enumeration.
应用推荐