当前位置：
首页 资源下载
搜索资源 - heuristic algorithm
搜索资源列表
-
0下载：
In order to minimize power losses caused by high current and improve the voltage profile in the network distribution, the introduction of dispersed generations also called productions decentralized in distribution network (DG) plays an important role
-
-
0下载：
GSO萤火虫群优化C语言代码。是一种启发式算法，灵感来自于萤火虫闪烁的行为。萤火虫的闪光，其主要目的是作为一个信号系统，以吸引其他的萤火虫。-GSO fireflies swarm optimization C language code. Is a heuristic algorithm, inspired by the fireflies blinking behavior. Fireflies flash, its main purpose is as a signaling system
-
-
0下载：
差分进化算法（DE）是一种用于优化问题的启发式算法。本质上说，它是一种基于实数编码的具有保优思想的贪婪遗传算法[1] 。同遗传算法一样，差分进化算法包含变异和交叉操作，但同时相较于遗传算法的选择操作，差分进化算法采用一对一的淘汰机制来更新种群。由于差分进化算法在连续域优化问题的优势已获得广泛应用，并引发进化算法研究领域的热潮。 差分进化算法由Storn 以及Price [2]提出，算法的原理采用对个体进行方向扰动，以达到对个体的函数值进行下降的目的，同其他进化算法一样，差分进化算法不利用函数的梯
-
-
0下载：
关于经典算法的思考与总结。涵盖KMP.遗传.启发式搜索.图像
特征提取 SIFT.傅立叶变换.Hash.快速排序.SPFA.快递选择 SELECT A*.Dijkstra.DP.BFS/DFS.红黑树等 15 个经典基础算法，
共计 31 篇文章，包括算法理论的研究与阐述，及其编程的具体实现。很多个算法都后续写
了续集-Thinking about the classical algorithm and summary. Covering the KMP. Genetic heuri
-
-
0下载：
针对分布式媒体服务系统中的副本放置问题，从优化节点间的传输代价出发，提出一种基于全局信息的启发式副本放置算法——
Zero2min，与现有算法相比，节省传输代价10 ~36 。根据Zero2min 算法的思路，给出媒体内容逐渐增加情况下的一种动态放置方法，仿真结果表明，其代价小于Max2min。-Aiming at the problem of replica placement in a distributed media system to reduce the cost of tran
-
-
3下载：
应用启发式算法-粒子群算法PSO，解决物流配送中心选址问题，结果好的解决了上述问题，值得参考。-PSO Particle Swarm algorithm using heuristic algorithm to address the logistics distribution center location problems, resulting in a good solution for this problem, it is also useful.
-
-
1下载：
区别于以往传统最短路算法，如：Dijkstra算法或者Floyd算法。该算法为启发式最短路径搜寻算法：A STAR-Finding the shortest path: a heuristic algorithm named A STAR
-
-
0下载：
Location-allocation problem for intra-transportation system in a big company by using meta-heuristic algorithm
-
-
0下载：
A genetic algorithm (GA) is a search heuristic that mimics the process of natural selection.
-
-
0下载：
简单的基于matlab的启发式搜索算法。-The matlab simulation method of heuristic search algorithm。
-
-
0下载：
萤火虫算法（Firefly Algorithm）是一种启发式算法，灵感来自于萤火虫闪烁的行为。萤火虫的闪光，其主要目的是作为一个信号系统，以吸引其他的萤火虫。剑桥大学的Xin-She Yang（音译：杨新社）教授提出了萤火虫算法，其假设为[1]：
萤火虫不分性别，这样一个萤火虫将会吸引到所有其他的萤火虫
吸引力与它们的亮度成正比，对于任何两个萤火虫，不那么明亮的萤火虫被吸引，因此移动到更亮的一个，然而，亮度又随着其距离的增加而减少
如果没有比一个给定的萤火虫更亮的萤火虫，它
-
-
0下载：
n this paper, Optimization is considered as the main impact of insight problem and heuristic methods. A proposed method is represented by using two optimization algorithms cuckoo optimization is heuristic method and Genetic algorithm is meta-heuristi
-
-
0下载：
Most optimization problems in real life applications are often highly nonlinear. Local optimization algorithms do not give the desired performance. So, only global optimization algorithms should be used to obtain optimal solutions. This paper propose
-
-
0下载：
粒子群优化是一种新兴的基于群体智能的启发式全局搜索算法，粒子群优化算法通过粒子间的竞争和协作以实现在复杂搜索空间中寻找全局最优点。-Particle swarm optimization is a new global search heuristic algorithm based on swarm intelligence, particle swarm optimization algorithm by particle competition and collaboration to a
-
-
0下载：
Interval Type-2 Fuzzy Systems Trained by Hybrid Heuristic Algorithm for Stock Exchange of Thailand
-
-
0下载：
In the field of artificial intelligence, a genetic algorithm (GA) is a search heuristic that mimics the process of natural selection. This heuristic (also sometimes called a metaheuristic) is routinely used to generate useful solutions to optimizatio
-
-
0下载：
This paper presents a new algorithm for partitioning a gray-level image into connected homogeneous regions. The novelty of this
algorithm lies in the fact that, by constructing a minimum spanning tree representation of a gray-level image, it reduce
-
-
1下载：
Xin she Yang提出的布谷鸟算法，用来解决最优化问题。相比于传统的遗传算法和粒子群算法，该算法的效率更高。-It is published by Xin she Yang and is able to solve the optimization question。it is one of the heuristic algorithm and has the advantage compared with the GA and PSO.
-
-
0下载：
蚁群算法解决路径规划问题，可以自己设置地图中的障碍，使得规划路径避开障碍。运用蚁群算法计算比较简单。-ACO is one of the Heuristic algorithm,and it has a long history.The program is coded by MATLAB.It can solve the question that mapping the best route.
-
-
0下载：
Simulated Annealing (SA) is the oldest probabilistic
meta-heuristic algorithm and one of the first algorithms
having ability to avoid being trapped in local minima. It
is inspired by the process of annealing in metallurgy. In
this process a m
-
«
1
2
3
4
56
7
8
9
10
...
17
»
