搜索资源列表
dye-local-search
- Local search. Algorithm that explores the space of possible solutions in sequential fashion, moving from a current solution to a \"nearby\" one. Neighbor relation. Let S S be a neighbor relation for the problem. Gradient descent. Le
tabu
- 禁忌搜索（Tabu search）是局部邻域搜索算法的推广，Fred Glover在1986年提出这个概念，进而形成一套完整算法。 -Tabu search (Tabu search) is a local neighborhood search algorithm for the promotion, Fred Glover in 1986, proposed this idea, thus forming a complete set of algorithms.
LocalSearch
- This algorithm is used to process the obtained result from using google local search api-This algorithm is used to process the obtained result from using google local search api
347
- 在运行本程序时，检索整个局域网络，将局域网中的计算机名和IP地址显示在ListControl空间中。-Running the program, search the entire local area network LAN of the computer name and IP address appears in ListControl space.
3
- A Genetic Algorithm Hybridized with Local Search Operator
SAGAHillClimbing
- Simulated Annealing SA Hill Climbing HC Local Beam Search LBS Genetic Algorithm GA -Simulated Annealing SA Hill Climbing HC Local Beam Search LBS Genetic Algorithm GA
ModernAlgorithmCosole
- 多进程实现现代优化算法包括采用SSS的局部搜索、禁忌搜索算法和模拟退火算法的控制台-a console platform for modern optimization algorithm such as sss based local search taboo search and simulated annealing algorithm and so on
Guided_Local_Search_to_the_TSP
- 与禁忌搜索动态修改邻域结构的方法不同, GLS的基本原则是通过不断改变搜索空间的地形(landscape)来帮助搜索过程逐步移出局部极值的, 也就是说搜索过程中解结构和邻域结构将保持不变, 而目标函数将被动态修改, 以使得当前的局部极值不再具有局部最优性。-Guided Local Search sits on top of local search heuristics and has as a main aim to guide these procedures in exploring e
maugis
- 模拟退火和对称 *欧几里德旅行商问题。 * *为基础的解决办法的本地搜索启发式 *非过境道路和近邻 -/* * Simulated annealing and the Symetric * Euclidian Traveling Salesman Problem. * * Solution based on local search heuristics for * non-crossing paths and nearest neighbor
max-indep-set-wea2008
- Fast Local Search for the Maximum Independent Set
max-indep-set-wea2008_paper
- Fast Local Search for the Maximum Independent Set
m4-heuristics
- Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Simulated annealing search Local beam search Genetic algorithms
njuton
- optimization algorithm search local minimum function, very quick
Nqueenproblem
- 这个程序采用局部搜索算法（Local Search），速度很快， 在配置为奔腾200，内存64MB,上测试可以在 几秒钟内解一百万阶的皇后问题。-This procedure using a local search algorithm (Local Search), fast, in the configuration for the Pentium 200, RAM 64MB, the test solution in a few seconds of order 1 million
METSlib
- METSlib提供基本的启发式算法框架，包括局部搜索及其变体，模拟退火和禁忌搜索等。 -METSlib implements the basics of some metaheuristics algorithm: * Random Restart Local Search * Variable Neighborhood Search * Iterated Local Search * Simulated Annealing (with line
Tabu_Best
- Tabu search is a meta-heuristic that guides a local search towards better solutions.
MATLAB
- It is Local search 8qween problem
search
- java实现本地文件搜索的源代码，非常好的学习资料，注释写得很详细-to achieve a local file search java source code, a very good learning materials, notes to write a very detailed
MATLAB
- 实现局部寻找最大值点，通过Matlab软件实现-Local search for maximum points achieved by Matlab software
grasp
- GRASP (greedy randomized adaptive search Procedure) is an algorithm commonly applied to problems of combinatorial optimization. As various construction methods, the application of grasp is to create an initial solution and then perform a local search