搜索资源列表
C-W-savings-algorithm
- C-W节约算法是最经典的求解车辆路径问题的启发式算法。-The Clarke and Wright(1964) savings algorithm is perhaps the most widely known heuristic for the VRP.
EmpiricalResearchofVolatilitySpillover
- 论文首先介绍了行为金融学对完全信息假设的摒弃。接着利用启发式判断准 则推断了波动传递的起源。同时跨市交易者无意中造成了波动的传递。最后详细 阐述了羊群行为的产生机理和市场表现，分析了羊群行为对波动溢出的放大效应。 -First of all papers presented on behavioral finance to abandon the assumption of complete information. Then infer the use of heuristic c
Km
- In data mining, k-means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results in a partitioning of the data space into Vo
DEPTH-INSPIRE
- 深度启发方法，用于进行雾天图像的复原处理，是一种人工交互的方法-Depth heuristic method for image restoration processing fog, is a human interaction
Replica-Placement-Algorithm
- 针对分布式媒体服务系统中的副本放置问题，从优化节点间的传输代价出发，提出一种基于全局信息的启发式副本放置算法—— Zero2min，与现有算法相比，节省传输代价10 ~36 。根据Zero2min 算法的思路，给出媒体内容逐渐增加情况下的一种动态放置方法，仿真结果表明，其代价小于Max2min。-Aiming at the problem of replica placement in a distributed media system to reduce the cost of tran
JAVA-Eight-digital-problem
- 九宫排字问题（又称八数码问题）是人工智能当中有名的难题之一。问题是在 3×3 方格盘上，放有八个数码，剩下第九个为空，每一空格其上下左右的数码可移至空格。问题给定初始位置和目标位置，要求通过一系列的数码移动，将初始位置转化为目标位置。本文介绍用普通搜索方法、双向广度搜索和启发式搜索如何缩短寻找路径的时间，以及各算法间的利与弊。-Jiugong typesetting problem (also known as eight digital problem) is one of famous pr
enlighten
- 熟悉和掌握启发式搜索的定义、估价函数和算法过程，并利用A*算法求解N数码难题，理解求解流程和搜索顺序。-Be familiar with and master the definition of heuristic search, uation function and the algorithm process, and use the A* algorithm N digital problem, understand the solving process and the search
knapsack
- Development of a heuristic for the Knapsack problem
optimal_bucket
- Development of a heuristic for the Optimal-Bucket problem
pmedian
- Development of a heuristic for the pmedian problem