搜索资源列表
OBST
- 我用C++编写的二分最优查找!希望大家能用的着!-prepared by the two sub-optimal search! The hope everyone can be with! Thank you! !
06071419
- 机械优化设计的作业 包括一维搜索方法（二次差值，牛顿法，黄金分割法），以及最速下降法和内点惩罚函数法及等值线图-Optimal Design of mechanical operations, including one-dimensional search method (the second difference, Newton' s law, golden section method), and the steepest descent method and interior po
five_chess_source_code
- 五子棋游戏，采用alpha-beta剪枝优化搜索算法，深度可达6步。-five-chess game, with alpha-beta optimal search algorithm, the depth is up to 6 steps
optimal_BST
- this optimal binary search tree!! my masterpiece works-this is optimal binary search tree!! my masterpiece works!!
OBST
- Optimal binary search tr-Optimal binary search tree
Astar
- Search Optimal Path Algorithm.
binarytree
- Up to this point, we have assumed that an optimal search tree is one in which the probability of occurrence of all keys is equal (or is unknown, in which case we assume it to be equal). Thus we concentrated on balancing the tree so as to make the
finddepth
- 集合算法，最优二分搜索树，最长公共子序列，union—find算法的应用与推广-Collection algorithm, the optimal binary search tree, the longest common subsequence, union-find algorithm of the application and promotion of
TSP
- 提出一种改进的禁忌搜索算法来求解背包问题。该算法基于禁忌搜索技术,并采用I&D策略,同时设计了两种针对局 部最优解的变异算子。改进后的算法能有效地弥补标准禁忌算法对初始解依赖的缺陷,同时也避免了搜索停滞的现象。通过对具 体实例和随机问题的测试,表明改进后的禁忌搜索算法有更好的性能。 关-An improved tabu search algorithm to solve knapsack problem. The algorithm is based on tabu
G33D
- One of the weaknesses of the Stairs Approximation algorithm is that a lot of iterations are required because simultaneous movement of axes is not considered in the algorithm. Furthermore, possible error conditions are not considered when the inte
PAPR_OFDMprc
- PEAK TO AVERAGE POWER RATIO REDUCTION OF DM SIGNALS USING PEAK REDUCTION CARRIERS: ABSTRACT A technique is described for a better than 5 dB reduction in the Peak to Average Power Ratio (PAPR) of an OFDM signal. The optimal amplitude and pha
1111
- 基于免疫禁忌混合算法的多目标最优潮流计算[PDF].-Multi-objective Optimal Power Flow Calculation Based on Immune/Tabu Search Hybrid Algorithm
TravelingSalesmanProblem
- This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function Drzewoopt() functins stand for
OptimalBST
- 最优二叉搜索树的构建，动态规划实现。gcc编译通过，可将构建好的树以列表的形式打印出来。-Optimal binary search tree construction, Dynamic Programming. gcc compile.
hundun_matlab
- 用matlab*.m编程实现基本的混沌算法，可以在此基础上扩展应用，实现更加优化的混沌搜索算法-Programming with matlab*. m basic chaos algorithm, can extend this basis the application of chaos to achieve a more optimal search algorithm
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
power_system_reactive_power_optimization
- 优秀论论及对应源码。电力系统配电网的无功优化规划是保证配电网安全、经济运行的一项有效手段，是降低网损、提高电压质量的重要措施。因此，电力系统配电网无功优化规划问题的研究，既具有理论意义，又具有工程实际应用价值。配电系统最优规划问题是一个复杂的非线性组合优化问题，至今未得到很好的解决。Tabu搜索(TS—Tabu search)算法是近年来出现的用于求解组合优化问题的一种高效的启发式搜索技术。本文采用固定并联电容器作为研究对象对系统进行无功补偿，并利用智能优化方法得到使配电网损耗降低最大对应的最优
dyObst
- 使用动态规划算法实现的最优二叉查找树问题，算法基础中的基本算法。使用vc6.0进行编译-Dynamic programming algorithm using the optimal binary search tree problem, the algorithm based on the basic algorithm. Compiled using vc6.0
best-first-search
- 人工智能上机作业源代码，经编译能运行，实现最优搜索的程序-Artificial intelligence operations on the machine source code can be compiled to run, to achieve optimal search procedures
harmony search for network reconfiguration
- Network Reconfiguration using harmony search to optimal reconfifuration