搜索结果
找到约 9 项符合
heuristic 的查询结果
人工智能/神经网络 基因算法（GA） GA 是一种启发式的优化法 （heuristic optimization method）
基因算法（GA）
GA 是一种启发式的优化法 （heuristic optimization method）， 它是通过既定的随机搜索进行操作．优化问题的可能的解的集合被认为是 个体（individuals）组成的 人群（population）． 一个个体对它的环境的适应程度由它的 健康度（fitness）表示． ...
其他书籍 Heuristic search in artificial intelligence
Heuristic search in artificial intelligence
人工智能/神经网络 Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
matlab例程 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA)
物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spa ...
人工智能/神经网络 Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search ma
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 ...
软件设计/软件工程 This paper studies the problem of categorical data clustering, especially for transactional data ch
This paper studies the problem of categorical data clustering,
especially for transactional data characterized by high
dimensionality and large volume. Starting from a heuristic method
of increasing the height-to-width ratio of the cluster histogram, we
develop a novel algorithm – CLOPE, which is v ...
数据结构 密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data struct
密码学界牛人Victor Shoup用C++编写数论类库。
NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary precision floating point arithmetic.
N ...
数值算法/人工智能 Solve the 8-puzzle problem using A * algorithme. Input: Program reads start state and goal state
Solve the 8-puzzle problem using A * algorithme.
Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank.
There are 2 Heuristic:
1. N: Number of misplaced tiles
2. S: Sum of Manhattan distance of current location and target location.
...
论文 Bi-density twin support vector machines
In this paper we present a classifier called bi-density twin support vector machines (BDTWSVMs) for data classification. In the training stage, BDTWSVMs first compute the relative density degrees for all training points using the intra-class graph whose weights are determined by a local sc ...