Location:
Search - blind search
Search list
Description: 用广度优先搜索算法解决两个小孩的分油问题.盲目搜索算法.-with breadth - first search algorithm to solve two children, the sub-Oil. Blind search algorithm.
Platform: |
Size: 3736 |
Author: 刘先生 |
Hits:
Description: 1、对于凯撒密文，实现了：1种盲目式搜索，4种启发式搜索，以及利用密钥实现的凯撒加密系统。
2、对于代入法密文，实现了：2种启发式搜索，1种利用密钥的代入法加密系统以及随机生成密钥的代入法加密系统。
3、字典工具，实现了对词库的增加，删除，检查等一系列的操作。
4、7种其他较为经典的加密方法的加密解密工具。包括：DES、Vigenere、IDEA、Keyword、LFSR、Playfair以及RC4等。
-1, Caesar ciphertext, realized : a blind search species, four species of heuristic search, and the use of the keys for encryption system Caesar. 2, substituting it into law ciphertext, realized : two kinds of heuristic search, a key species used in lieu of law into the system and random encryption key generation to generation method of encryption systems. 3, dictionary tools, for the achievement of the Thesaurus of addition, deletion, and examined a series of operations. 4,7 kinds of other more classic methods of encryption tools for encryption and decryption. Including : DES, Vigenere, IDEA, Keyword, LFSR, Playfair and RC4, and so on.
Platform: |
Size: 10401253 |
Author: 陈守勇 |
Hits:
Description: 传教士和野人渡河问题盲目搜索算法 一个典型的人工智能算法-missionaries and Savage cross river blind search algorithm of a typical artificial intelligence algorithms
Platform: |
Size: 2831 |
Author: 乐呵呵 |
Hits:
Description: 传教士和野人渡河问题盲目搜索算法 一个典型的人工智能算法-missionaries and Savage cross river blind search algorithm of a typical artificial intelligence algorithms
Platform: |
Size: 3072 |
Author: 乐呵呵 |
Hits:
Description: 用广度优先搜索算法解决两个小孩的分油问题.盲目搜索算法.-with breadth- first search algorithm to solve two children, the sub-Oil. Blind search algorithm.
Platform: |
Size: 16384 |
Author: 刘先生 |
Hits:
Description: 互信息盲源分离，这基于这么一个事实，混合信号的互信息最小时，意味着信号独立。可以参考有关书籍。在google里面，搜索mutual information blind source separation.即可搜到文章。-mutual information Blind Source Separation, such a fact-based, mixed-signal information in the most hours of each other, mean signal independence. Can reference to the books. Google the inside, Search mutual information blind source separation . that article can be found.
Platform: |
Size: 350208 |
Author: 马明 |
Hits:
Description: 1、对于凯撒密文，实现了：1种盲目式搜索，4种启发式搜索，以及利用密钥实现的凯撒加密系统。
2、对于代入法密文，实现了：2种启发式搜索，1种利用密钥的代入法加密系统以及随机生成密钥的代入法加密系统。
3、字典工具，实现了对词库的增加，删除，检查等一系列的操作。
4、7种其他较为经典的加密方法的加密解密工具。包括：DES、Vigenere、IDEA、Keyword、LFSR、Playfair以及RC4等。
-1, Caesar ciphertext, realized : a blind search species, four species of heuristic search, and the use of the keys for encryption system Caesar. 2, substituting it into law ciphertext, realized : two kinds of heuristic search, a key species used in lieu of law into the system and random encryption key generation to generation method of encryption systems. 3, dictionary tools, for the achievement of the Thesaurus of addition, deletion, and examined a series of operations. 4,7 kinds of other more classic methods of encryption tools for encryption and decryption. Including : DES, Vigenere, IDEA, Keyword, LFSR, Playfair and RC4, and so on.
Platform: |
Size: 10400768 |
Author: 陈守勇 |
Hits:
Description: 本程序是利用盲目搜索算法中的深度优先算法实现八数码问题的解决，用的C++的MFC框架类平台，有界面，先置初始状态，然后开始搜索，其中‘0’代表空格，会显示出搜索的步数以及每步的状态。-This procedure is the use of the blind search algorithm of depth-first algorithm to achieve the eight digital issue, used C++ The MFC framework type platform has interfaces, first buy the initial state, and then began to search, in which representatives of spaces
Platform: |
Size: 40960 |
Author: 崔娜 |
Hits:
Description: 我传的第一个是八数码的盲目搜索,而这个是A*,请指教-I Chuan first eight digital blind search, and this is A*, please advice
Platform: |
Size: 40960 |
Author: wgq |
Hits:
Description: 本程序采用 blind breadth search解eight puzzles问题, 且消除了重复的布局。-This procedure blind breadth search solution using eight puzzles problems, as well as the elimination of duplicate layout.
Platform: |
Size: 9216 |
Author: chen yong |
Hits:
Description: 设计一类peg jump问题的求解系统，初步掌握智能搜索算法中的盲目搜索和启发式搜索这两类基本方法，同时通过具体的问题体会搜索算法、数据结构、程序设计等知识的综合应用。-Peg jump for a class of design problem solving systems, intelligent search algorithm for the initial grasp of the blind search and heuristic search these two types of basic methods, at the same time through the experience of specific problems search algorithm, data structure, program design, such as the comprehensive application of knowledge.
Platform: |
Size: 61440 |
Author: chenyanli |
Hits:
Description: 八数码问题的C++程序代码。八数码问题是个典型的状态图搜索问题。搜索方式有两种基本的方式，即树式搜索和线式搜索。搜索策略大体有盲目搜索和启发式搜索两大类。盲目搜索就是无“向导”的搜索，启发式搜索就是有“向导”的搜索。-8 digital issues of C++ program code. Digital 8 is a typical problem of the state map search problems. There are two basic search methods, namely, tree-type search and linear search. Search strategy has largely blind search and heuristic search two categories. Blind search is no " wizard" of the search, heuristic search is a " guide" the search.
Platform: |
Size: 55296 |
Author: 李建峰 |
Hits:
Description: 一个很好的迷宫自动搜索程序，盲目搜索策略-A maze of automatic search procedures, blind search strategy
Platform: |
Size: 153600 |
Author: 张歆业 |
Hits:
Description: 解决n-queens using blind search-solving n-queens using blind search
Platform: |
Size: 1024 |
Author: justinshih |
Hits:
Description: 该文件是wml，有利于学习手机开发者学习的很好材料。避免学者在网络上盲目搜索，浪费时间。-The file is wml, conducive to learning mobile developers learn from the material. Scholars on the network to avoid blind search, a waste of time.
Platform: |
Size: 359424 |
Author: leaf |
Hits:
Description: 人工智能博弈树学习。用户是MAX方，电脑是MIN方，实现经典的分钱币游戏的与或图盲目搜索算法。-Artificial intelligence game tree learning. MAX user side, the computer is MIN parties to achieve the classic sub-games and coins or graph blind search algorithm.
Platform: |
Size: 925696 |
Author: 王石 |
Hits:
Description: The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the usual DFS (Depth First Search) and BFS( Breadth First Search) exploration algorithms perform a blind search of the graph. Ideally, the ranking function, c(x), ranks nodes based on the cost of a minimal solution reachable from node x. The problem with this ranking function is that the minimal solution must be known ahead of time. Instead, the ranking function uses an estimate, g(x), of the cost of a minimal solution reachable from node x. Using g(x) to rank nodes may require exploring unnecessary nodes in the graph?particularly if g(x) is not a good estimate.The final element of the ranking function measures the cost of reaching a node from the root. As the searches gets farther from the root node, the node falls in the ranking.
Platform: |
Size: 8192 |
Author: sathiyaraj124 |
Hits:
Description: 人工智能的应用技术，主要讲述了图搜索策略，盲目搜索，启发式搜索并附有实例。-The application of artificial intelligence techniques, search strategy focuses on the figure, the blind search, heuristic search together with examples.
Platform: |
Size: 1241088 |
Author: 萧风 |
Hits:
Description: 以八数码问题为例，设计一类滑块问题的求解系统，初步掌握智能搜索算法中的盲目搜索和启发式搜索这两类基本方法，同时通过具体的问题体会搜索算法、数据结构、程序设计等知识的综合应用
A*用到是不在位将牌数和曼哈顿距离，动态显示，有算时间
我自己很用心做的，有实验报告，绝对详细-Eight digital issues, for example, design a slider problem solving system, initially grasp the two basic methods of blind search and heuristic search, intelligent search algorithm, specific issues to realize the search algorithm, data structures, program design such as the integrated application of knowledge
A* used be out of position, the license number and the Manhattan distance, dynamic display, operator time
I am very hard to do, there are experimental reports, absolutely...
Platform: |
Size: 3544064 |
Author: 陆飞 |
Hits:
Description: 详细讲述了状态空间的表示以及盲目搜索、启发式搜索等的基本原理
-Details about the basic principles of the state space representation and blind search, heuristic search
Platform: |
Size: 642048 |
Author: wjshao |
Hits: