搜索资源列表
HeuristicBoxman
- 使用启发式算法编写的推箱子游戏,有图形界面,可以自动演示最优步骤-use heuristics prepared by the RSS games, graphics interface, automatic optimal demonstration steps
dossier
- For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics
qifa
- 启发式算法DOC文本,复制到C++中可直接运行.-heuristics DOC text copied to the C can be directly run.
AddisonWesleyObject-OrientedDesignHeuristics
- Object-Oriented Design Heuristics By Arthur J. Riel Publisher : Addison Wesley Pub Date : April 30, 1996 经典的面向对象设计书籍
ONTOLOGY_BASED
- A FRAMEWORK FOR EXTRACTION PLANS AND HEURISTICS IN AN ONTOLOGY-BASED DATA-EXTRACTION SYSTEM
PSOBPlunwen
- 基于PSO的BP训练算法论文：在BP训练算法中，关于变权值、学习速率、步长的问题已被广泛地研究，几种基于启发式改进的技术也表明具有改善训练时间以及避免陷入局部最小的明显效果。这里BP训练过程由基于PSO同时优化log—Sigmoid函数与网络权值的新算 法(PSO。GainBP)实现。实验结果表明，PSO—GainBP比传统基于PSO的BP算法在网络训练方面具有更好的性能。-PSO based on the BP training algorithm Papers: In the BP tr
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
Xcon2005_Drew_Copley
- Very good information about Anti-Virus Heuristics. by Drew Copley
maugis
- 模拟退火和对称 *欧几里德旅行商问题。 * *为基础的解决办法的本地搜索启发式 *非过境道路和近邻 -/* * Simulated annealing and the Symetric * Euclidian Traveling Salesman Problem. * * Solution based on local search heuristics for * non-crossing paths and nearest neighbor
3540744452
- When designing and implementing heuristics for discrete optimization problems, there are many choices to be made. These include search paradigms, search mechanisms, search parameters, test sets, etc. Often these choices are treated as independe
Clean.Code
- 不错的一本书，最近在做代码优化和重构的时候看的，给大家分享一下-Clean Code is divided into three parts. The first describes the principles, patterns, and practices of writing clean code. The second part consists of several case studies of increasing complexity. Each case study is a
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
heuristics
- CSC 550: Introduction to Artificial Intelligence Fall 2004 heuristics & informed search heuristics hill-climbing bold + informed search potential dangers, variants best first search tentative + informed search best-first search vs.
tochkisrc
- Delphi realization of well-known points game. Compiles with Delphi 7. Demonstrates simple depth search with some heuristics in estimate function.
FEC
- 聚类算法中的启发式算法中的FEC算法，可以处理复杂网络的问题。-Clustering algorithm heuristics in the FEC algorithm can handle complex network problems.
MATLAB
- it is a matlab program for ga sa tabu sworm opt heuristics we can also use matlab here. or there can
exam1
- ssd4的exam1，考的有两点，一是启发式思维的判别，二是运用vb进行编程-The examination, ssd4 exam1 has two, one is the heuristics, two is programmed with vb
nQueens
- 人工智能课程实验：使用启发式搜索求解皇后问题。启发式搜索是利用度量作为指南的一种搜索方法。皇后问题是计算机界的经典问题，n皇后问题为把n个皇后放入一个n*n的棋盘中，使皇后两两不在同一行，同一列以及同一斜线中。求解n皇后问题的算法众多，主要有回溯法，构造法，概率算法以及本实验所用的启发式搜索方法等。方法不同，求解问题所产生的时间效率也大不相同，本实验主要对比构造法与启发式搜索方法的效率。 -Artificial Intelligence Curriculum Experiment: Usin
Simple-Heuristics
- 本书内容包括:研究的总体框架、基本无知的决策制定、单一理由决策制定、超越选择——记忆、估计和分类等-Simple Heuristics That Make Us Smart invites readers to embark on a new journey into a land of rationality that differs from the familiar territory of cognitive science and economics. Traditional view
Heuristics
- Heuristics algorithm course