English translation for "穷举搜索"

exhaustion search
exhaustive searching

Related Translations:

穷坚:  qiong jian

叫穷:  make a poor mouth

穷田:  kubota

穷富:  rich and poor

穷措大:  [贬义] a miserable and shabby poor scholar in the old days

杜穷:  dujung

穷的:  badly offbadly-offpoorworse-offworst-off

格穷:  gaqung

途穷反噬:  when a beast comes to the end of a road, it turns back to bite

穷举算法:  exhaust algorithm

Example Sentences:

	1.	A process whereby up to every possible value is tried until a match is found also known as an exhaustive search 尝试每个可能的值直到找到匹配值为止的过程（又称为穷举搜索） 。
	2.	Our new technique avoids the space blow up of bdds , and extends the concept of bounded model checking 由于模型检测技术是基于对状态空间的穷举搜索，状态爆炸问题是模型检测技术面临的主要困难。
	3.	One way to compromise data encrypted with this type of cipher is to perform an exhaustive search of every possible key 可以危及用此类型密码加密的数据的一个方法是，对每个可能的密钥执行穷举搜索。
	4.	If it takes three months to perform an exhaustive search to retrieve data that is only meaningful for a few days , then the exhaustive search method is impractical 如果执行彻底搜索来检索只在几天内有意义的数据需要花费三个月的时间，那么穷举搜索的方法是不实用的。
	5.	And an exhaust - search sample - driven algorithm , signal compatible algorithm which can find monad patterns , was proposed , and the search algorithm was depth - limit algorithm 在此基础上,针对单一模式发现问题,文提出并实现了一种穷举搜索的模式发现算法? ?信号相容性算法( signalcompatiblealgorithm , sca ) 。
	6.	Traveling salesman problem is combinatorial optimization problem in graph theory , it has npc computation complexity , and lots of problem can transfer to traveling salesman problem . the computation of tsp is analyzed , then the hopfield network method for solving tsp is given , at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling 首先分析了旅行商问题在穷举搜索法下的工作量；其次给出了求解旅行商问题的hopfield神经网络方法，同时分析了利用人工神经网络求解旅行商问题所存在的问题；最后利用混饨神经网络模型求解10城市旅行商问题和中国旅行商问题。
	7.	Compared with exhausitive search algorithm , the search amout is remarkable reduced by this algorithm and the algorithm is very efficiency . with the searched perfect binary array pairs and quasi - perfect binary array pairs , new perfect binary array pairs of high dimension and volume can be constructed by all kinds of construct methods 通过与穷举搜索算法的比较，本算法大大减少了搜索数量，具有较高的效率。利用搜索得到的最佳二进阵列偶和准最佳二进阵列偶，可以用各种构造方法构造出新的高维和高阶的最佳二进阵列偶。

Similar Words：

"穷举过程" English translation, "穷举极限" English translation, "穷举破译" English translation, "穷举事件" English translation, "穷举输入测试" English translation, "穷举搜索完全搜索" English translation, "穷举算法" English translation, "穷举索引" English translation, "穷举组合搜索算法" English translation, "穷开心" English translation