That approach may sound straightforward in theory, but in practice the vast variety of database structures and possible search terms poses a thorny computational challenge.
这种做法可能在理论上听起来很简捷，但在实践中大量各种不同的数据库结构和可能的搜索词构成了一个棘手的计算挑战。
The mission of computational materials scientists, like myself, is to narrow down the experimental search space that experimentalists need to explore in order to optimize a given material.
像我这样的计算机材料科学家的任务就是缩小实验者们为完善给定的材料所需要探索的试验尝试的空间。
In the past, RWW has covered a number of search relevancy projects that incorporate human computational power including Semanti.
过去，读写网就已经报道过许多结合了人脑计算能力来改善搜索相关度的项目，其中包括Semanti。
In addition, strategies of motion track and adaptive search window are applied to reduce the computational complexity of motion estimation.
此外本文还采用运动跟踪和自适应搜索窗技术来减小运动估值的计算复杂性。
Indeed, maybe it is actually wrong to call it a search engine at all (and Wolfram prefers to call it a "computational knowledge engine").
事实上，将其称为搜索引擎都是一个误解，Wolfram更乐意“computationalknowledgeengine”这个名称。
As a global optimized search means, Genetic Algorithms (GA) are computational models simulating the evolutionary mechanism of nature.
遗传算法(GA)是模拟自然界生物进化机制的计算模型，是一种全局优化搜索方法。
Experimental results show that the proposed algorithm can reduce computational complexity efficiently, and at the same time while, ensuring the search accuracy.
实验结果证明，该算法在降低计算复杂度的同时，还能有效地保证搜索精度。
The new algorithm does not require two-dimensional search and has low computational complexity.
此外，该算法不需要谱峰搜索，具有计算复杂度低的优点。
The computational experience shows scatter search works well for MAHSCP.
分散搜索算法在求解MAHSCP时具有很好的计算效果。
The antenna selection algorithm is the exhaustive search method. Its computational complexity grows rapidly as the number of antennas increases. It is quite impractical.
穷举搜索天线选择算法的计算复杂度随天线的增多变大，影响实际应用。
The larger the codebook size or the vector dimension is, the higher the computational complexity of the full-search VQ is.
码书大小和矢量维数越大，穷尽搜索矢量量化编码的计算复杂度就越高。
The problem is analyzed which lies in the existing downlink synchronization sequence(SYNC_DL) search method in TD-SCDMA system that the robustness is poor and the computational complexity is high.
分析了现有TD-SCDMA系统中下行同步序列（SYNC_DL）搜索方法的频率鲁棒性和计算复杂度方面存在的问题。
Although this approach intuitively suggests significant reduction of computational cost, storing previous solutions could significantly disrupt the pattern formation during the search.
虽然这个方法直观地显示显著降低计算复杂度，储存以前的解决方案能显著破坏模式形成在搜索。
Experimental results show that our algorithm can reduce the computational-complexity to 3% of fast full search motion estimation algorithm, with negligible PSNR loss and bit rate increase.
试验结果证明，该算法能够将计算复杂度降低到快速全搜索运动估计算法的3%，而PSNR和码率几乎与快速全搜索算法得到的结果相当。
Motion estimation is the most important and time-consuming part in H. 264. A large number of algorithms are based on the reduction of search points to reduce the computational complexity.
运动估计作为H . 264中最重要最耗时的部分，大量的算法研究都是通过减少搜索点数来降低计算量。
Furthermore, the method which is able to search the best result in the whole region is prone to programming and can greatly reduce the computational time based on a certain precision.
此外，该算法具有全局寻优能力，并能在保证一定精度的基础上，有效地减少计算量，并易于编程实现。
Many fast block-based motion estimation algorithms have been proposed to reduce the computational complexity, for examples, three-step search, four-step search, new three-step search, etc.
于是人们提出了许多快速搜索算法，包括三步法、新三步法和四步法等，这些算法在满足一定精度的条件下可以大大减少运算量。
Many fast block-based motion estimation algorithms have been proposed to reduce the computational complexity, for examples, three-step search, four-step search, new three-step search, etc.
于是人们提出了许多快速搜索算法，包括三步法、新三步法和四步法等，这些算法在满足一定精度的条件下可以大大减少运算量。
应用推荐