Description: 这是一个贪心算法的c程序。贪心算法（也叫贪婪算法）不是某种特定的算法，而是一类抽象的算法，或者说只是一种思想，它的具体表现在，对解空间进行搜索时，不是机械地搜索，而是对局部进行择优选取，贪心算法的目的不是为了找到全部解，也当然找不出最优解，而只是找出一种可行解，这样就会得到惊人的高效性。因此，贪心算法也叫启发式搜索，这种启发就是所谓的“贪心策略”。-This is a greedy algorithm c procedures. Greedy algorithm (also known as the greedy algorithm) is not a specific algorithm, but a kind of abstract algorithm, or just a thought, it is specifically manifested in the solution space search, the search is not mechanical, but the partial merit selection, greedy algorithm not for the purpose of to find all the solutions are, of course, unable to find the optimal solution, but only to find out a feasible solution, and this can be alarming efficiency. Therefore, the greedy algorithm is called heuristic search, which inspired the so-called "greedy strategy." Platform: |
Size: 1170 |
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: 启发式搜索就是在状态空间中的搜索对每一个搜索的位置进行评估，得到最好的位置，再从这个位置进行搜索直到目标。这样可以省略大量无畏的搜索路径，提到了效率-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: 采用启发式搜索算法，能解任意合法的数独（由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: 用状态空间法求解传教士-野人问题，设计启发式函数引导规则的选用。
通过设计，深入理解状态空间概念与启发式搜索技术，培养一般问题求解能力。-Using state space method for solving the missionaries- Yeti issues, design heuristic function to guide the selection of the rules. By design, in-depth understanding of the concept of the state space and heuristic search techniques, developing general problem-solving ability. Platform: |
Size: 2048 |
Author:chaoyalin |
Hits:
Description: 禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method. Platform: |
Size: 475136 |
Author:logspace |
Hits:
Description: 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of optimization problems to solve new general heuristic method, which has a positive feedback, distributed computing and constructive and the greedy heuristic search features. Through the establishment of an appropriate mathematical model, over-current fault-based distribution network fault location into a nonlinear global optimization problem. Platform: |
Size: 3072 |
Author:prince |
Hits:
Description: 优秀论论及对应源码。电力系统配电网的无功优化规划是保证配电网安全、经济运行的一项有效手段，是降低网损、提高电压质量的重要措施。因此，电力系统配电网无功优化规划问题的研究，既具有理论意义，又具有工程实际应用价值。配电系统最优规划问题是一个复杂的非线性组合优化问题，至今未得到很好的解决。Tabu搜索(TS—Tabu search)算法是近年来出现的用于求解组合优化问题的一种高效的启发式搜索技术。本文采用固定并联电容器作为研究对象对系统进行无功补偿，并利用智能优化方法得到使配电网损耗降低最大对应的最优节点解。并在补偿容量的邻域搜索方面做了改进，采用扩大邻域搜索范围以达到全局最优的效果。用IEEE的两个算例得出的计算结果证明了这种方法的可行性。-Excellent deals on the corresponding source code. Power system with reactive power distribution network optimal planning is to ensure the safety, economic operation of an effective means of reducing the net loss, an important measure to improve the voltage quality. Therefore, the power system reactive power optimization of distribution network planning study, not only has theoretical significance, but also has practical engineering value. Optimal distribution system planning is a complicated nonlinear optimization problem, has not been solved. Tabu Search (TS-Tabu search) algorithm is used in recent years for solving combinatorial optimization problems an efficient heuristic search techniques. In this paper, as the research object of fixed shunt capacitors for reactive power compensation system, and using intelligent optimization method to reduce the loss of the largest distribution network node corresponding to the optimal solution. Compensation capacity in the neighborhood search are Platform: |
Size: 112640 |
Author:NBB |
Hits:
Description: 人工智能启发式搜索八数码问题求解，该代码有点小问题-Eight digital AI problem solving heuristic search, the code bit of a problem Platform: |
Size: 3072 |
Author:angel |
Hits:
Description: 图搜索的非启发式和启发式算法, 着重分析了它们各自的复杂性、优缺点及
其相互关系, 提出了改进要点. 这对于如何选用一个合适的搜索算法是十分有益的.-Figure of non-heuristic and heuristic search algorithm, analyzes the complexity of their respective advantages and disadvantages and their relationship, an improved points. This is how to choose an appropriate search algorithm is very useful. Platform: |
Size: 83968 |
Author:quanyecha |
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: IEEE文章，启发式搜索策略用于
确定最佳的电容布局和
供配电系统的评等。在启发式
方法提出了一个关键的少数
名为“敏感节点，节点，选择
安装电容器优化净储蓄
同时实现了大的整体亏损减少。
这种方法保证了电压约束
会见。这种启发式的方法是适合大
配电系统，并可以在网上有用
实施。该方法是
用于测试系统和结果
与其他已发表的技术。
-Heuristic search strategies are used to
determine the optimum capacitor placement and
ratings for distribution systems. In the heuristic
approach proposed a small number of critical
nodes, named sensitive nodes, are selected for
installing capacitors that optimise the net savings
while achieving a large overall loss reduction.
This method insures that voltage constraints are
met. This heuristic approach is suitable for large
distribution systems and can be useful in online
implementation. The proposed approach is
applied to a test system and the results are
compared with other published techniques. Platform: |
Size: 621568 |
Author:徐正 |
Hits:
Description: 详细讲述了状态空间的表示以及盲目搜索、启发式搜索等的基本原理
-Details about the basic principles of the state space representation and blind search, heuristic search Platform: |
Size: 642048 |
Author:wjshao |
Hits:
Search - heuristic search