Location:
Search - heuristic
Search list
Description: Heuristic search in artificial intelligence-Heuristic search in artificial intellige Haye
Platform: |
Size: 36155 |
Author: 许任 |
Hits:
Description: 粗糙集的属性约简的一种启发式算法的C++实现，可以大大提高效率。-rough set of attributes about a simple heuristic algorithm to achieve C, which can greatly improve efficiency.
Platform: |
Size: 37888 |
Author: new |
Hits:
Description: 本程序可以实现有启发式函数的八数码搜索问题：你可以输入任何合理的初始值和中止值，就可以运行并输出最优解！-this program can achieve a heuristic function of eight digital Search : you can import any reasonable value and the initial value of the stay on the run and the output optimal solution!
Platform: |
Size: 64512 |
Author: efeffeef |
Hits:
Description: 开发环境:Matlab
简要说明:动量-自适应学习调整算法。在实际应用中，原始的BP算法很难胜任，因此出现了很多的改进算法。BP算法的改进主要有两种途径，一种是采用启发式学习方法，另一种则是采用更有效的优化算法。本例采用动量BP算法，来实现对网络的训练过程，动量法降低了网络对于误差曲面局部细节的敏感性，有效地抑制网络陷于局部极小。-development environment : Matlab Brief Description : Momentum-adaptive learning algorithm adjustments. In practical application, the original BP algorithm competence, resulting in a lot of improved algorithm. BP algorithm improvements There are two main ways of using a heuristic approach to learning Another is the use of a more effective method of optimization. Momentum cases using the BP algorithm to achieve the network training process, Momentum for reducing error of the network for local surface details of the sensitivity, to effectively curb the network into local minima.
Platform: |
Size: 1024 |
Author: zhangjian |
Hits:
Description: 基因算法（GA）
GA 是一种启发式的优化法 （heuristic optimization method）， 它是通过既定的随机搜索进行操作．优化问题的可能的解的集合被认为是 个体（individuals）组成的 人群（population）． 一个个体对它的环境的适应程度由它的 健康度（fitness）表示． -genetic algorithm (GA) GA is a heuristic optimization method (heuristic optimi method. 5), which is established through a random search for the operation. Optimization of the solution may be considered a collection of individuals (individuals) of the crowd (pop ulation). It's an individual adaptation to the environment by its Health (fitness).
Platform: |
Size: 16384 |
Author: 黄波 |
Hits:
Description: Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
-Implemented BFS, DFS and A* To compile this project, use the following command: g++-O search main.cppThen you can run it:./SearchThe input is loaded from a input file in.txtHere is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm.Then there is an integer h indicate the number of heuristic.The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
Platform: |
Size: 3072 |
Author: bo |
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: 人工智能八数码源代码 启发式搜索解决八数码问题的源代码 8数码难题算法,界面比较漂亮。操作简单-eight digital artificial intelligence heuristic search the source code to solve the problem eight digital source code 8 puzzle algorithm, interface more beautiful. Simple operation
Platform: |
Size: 2485248 |
Author: 小风 |
Hits:
Description: Heuristic search in artificial intelligence-Heuristic search in artificial intellige Haye
Platform: |
Size: 35840 |
Author: 许任 |
Hits:
Description: 一种基于启发式算法(互信息熵)的粗糙集约简源代码-A heuristic algorithm based on (mutual information entropy) Rough Jane intensive source code
Platform: |
Size: 4104192 |
Author: 王京 |
Hits:
Description: java编写的最短路径算法，先由启发式方法获得染色体的初始编码，然后由遗传算法求出最短路径，对解决物流领域的TSP是非常好的计算机实现-java prepared by the shortest path algorithm, by the heuristic method to obtain the initial encoding of chromosome, and then by the genetic algorithm to derive the shortest path to solve the TSP area of logistics is a very good computer
Platform: |
Size: 312320 |
Author: wangxiaofang |
Hits:
Description: 爬山算法是一种局部择优的方法，采用启发式方法，是对深度优先搜索的一种改进，它利用反馈信息帮助生成解的决策。 属于人工智能算法的一种。-Climbing algorithm is a partial merit-based approach, using heuristic methods, is a depth-first search of an improvement, which uses feedback information to generate solutions to help decision-making. Belong to a kind of artificial intelligence algorithms.
Platform: |
Size: 1024 |
Author: ccy |
Hits:
Description: 启发式搜索就是在状态空间中的搜索对每一个搜索的位置进行评估，得到最好的位置，再从这个位置进行搜索直到目标。这样可以省略大量无畏的搜索路径，提到了效率-Heuristic search in state-space search for each search position to assess the best location, and then search from this position until the goal. This will omit a large number of fearless search path, referred to the efficiency of
Platform: |
Size: 165888 |
Author: 光远 |
Hits:
Description: Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
Platform: |
Size: 1797120 |
Author: foxman |
Hits:
Description: 实现了蚁群算法求解TSP问题。注释详细
function[R_best,L_best,L_ave,Shortest_Route,Shortest_Length]=ACATSP(C,NC_max,m,Alpha,Beta,Rho,Q)
-------------------------------------------------------------------------
主要符号说明
C n个城市的坐标，n×2的矩阵
NC_max最大迭代次数
m蚂蚁个数
Alpha表征信息素重要程度的参数
Beta表征启发式因子重要程度的参数
Rho信息素蒸发系数
Q信息素增加强度系数
R_best各代最佳路线
L_best各代最佳路线的长度
=========================================================================
-Ant Colony Algorithm for the realization of the TSP problem. Notes the detailed function [R_best, L_best, L_ave, Shortest_Route, Shortest_Length] = ACATSP (C, NC_max, m, Alpha, Beta, Rho, Q) ------------------------------------------------------------------- The main symbol------ C n that cities coordinates, n × 2 matrix NC_max the largest number of iterations m the number of Alpha ant pheromones characterized the importance of the parameters Beta factor heuristic importance of characterization of the parameters Rho evaporation coefficient of pheromone pheromone Q increase in intensity coefficient R_best best route generations generations L_best the length of the best route ====== ================================================== =================
Platform: |
Size: 2048 |
Author: 王晶 |
Hits:
Description: 在VC环境下用C++语言编写的一字棋小程序，采用人工智能原理里的博弈树的启发式搜索原理-VC environment in C++ language with the preparation of the word game of small procedures, the principle of the use of artificial intelligence in the game tree search heuristic principle
Platform: |
Size: 959488 |
Author: lina |
Hits:
Description: 采用启发式搜索算法，能解任意合法的数独（由input.txt文件输入），还能自动生成唯一解的数独初局-Using heuristic search algorithm, to obtain any number of legal independence (from the input.txt file input), can automatically generate a unique solution of the early Sudoku Board
Platform: |
Size: 4096 |
Author: 王加福 |
Hits:
Description: heuristic algotrihm for travelling salesman problem
Platform: |
Size: 3072 |
Author: sadi |
Hits:
Description: The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator
matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is
introduced. The method is based on a rigorous approach to spin glasses developed by Francesco
Guerra. It allows to construct lower bounds on the entropy of the transmitted message conditional
to the received one. Based on heuristic statistical mechanics calculations, we conjecture
such bounds to be tight. The result holds for standard irregular ensembles when used over
binary input output symmetric channels.
The method is first developed for Tanner graph ensembles with Poisson left degree distribution.
It is then generalized to ‘multi-Poisson’ graphs, and, by a completion procedure, to
arbitrary degree distribution.
Platform: |
Size: 457728 |
Author: mike zhou |
Hits:
Description: Heuristic solution for the traveling salesman problem
Platform: |
Size: 2048 |
Author: Guilherme |
Hits:
« 12
3
4
5
6
7
8
9
10
...
32
»