搜索资源列表
coloring_graph
- Algorithm colouring graph minimum numbers of colours. Dsatur heuristic algorithm.
setcover
- presents the heuristic solution of set covering problem-presents the heuristic solution of set covering problem.....
eserv
- Abstract. In this paper, we propose a method of hiding sensitive classification rules from data mining algorithms for categorical datasets. Our approach is to reconstruct a dataset according to the classification rul
acp
- 蚁群算法是通过模拟蚂蚁觅食而发展出的一种新的启发算法 基于群体的协作与学习 该算法已 经成功地解决诸如× ≥° 问题等多种组合优化问题 本文提出了一种基于自适应调整信息素的改进蚁群算法 该算法根据人工蚂蚁所获得解的情况 动态地调整路径上的信息素 从而使得算法跳离局部最优解 通过仿真
nachos
- Nachos的全称是“Not Another Completely Heuristic Operating System”,它是一个可修改和跟踪的操作系统教学软件。它给出了一个支持多线程和虚拟存储的操作系统骨架,可让学生在较短的时间内对操作系统中的基本原理和核心算法有一个全面和完整的了解。 -Nachos stands for " Not Another Completely Heuristic Operating Syst
yiqun
- 蚁群算法是一种用来在图中寻找优化路径的机率型技术,该算法具有许多优良的性质,具有一种新的模拟进化优化方法的有效性和应用价值, 是一种求解组合最优化问题的新型通用启发式方法,可以解决一维静态优化问题甚至多维动态组合优化问题。 -Ant colony algorithm is a method used to find optimal path in the graph of the probability-based technolo
TheResearchBaseonMemetiMeta-heuristic
- memetic 优化算法的研究文献.有用的可以参考一下-memetic optimization algorithm of the research literature. a useful reference for
MCproblem
- 人工智能解决野人传教士本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题(M-C问题)。实验设计采用产生式系统的概念,将问题用状态空间表示,搜索技术采用状态空间启发式搜索的A*算法,规则设计采用产生式规则,用C语言实现了A*算法求解M-C问题,加深了对人工智能的认识与理解。过河问题。-Of artificial intelligence to solve Savage missiona
BGA
- 题目:非平稳时间序列突变检测的启发式分割算法(BG算法) 本源码实现了下面参考文献中的算法,并对该文献中的实例进行了仿真-Title: Non-stationary time series mutation detection heuristic segmentation algorithm (BG algorithm) of the source references to achieve the following algori
wanggeqifashifangzhi
- 网格式一种新型的网络技术,一种新型的网络思想,在这里我们着重讲述了启发式的思想来解决网格中服务器的放置问题-Grid type a new network technology, a new type of network thinking, here we focus on thinking about the heuristic to solve the problem place the grid servers
MC_3points
- 蒙特卡罗启发式搜索算法,在平面内的多个点找到任意三点组成对大三角形的面积-Monte Carlo heuristic search algorithm, a number of points in the plane to find any of three large triangular area formed
Twophraseheuristicalgorithm
- 编好的两阶段启发式算法求解LRP问题,里面嵌套节约算法-Two-phrase heuristic algorithm LRP
Tabu_Best
- Tabu search is a meta-heuristic that guides a local search towards better solutions.
TheStudyofAAlgorithminImplementingofGame
- 图搜索技术能够从图中寻找一条从起点到目标点的路径. 围绕游戏寻径问题,介绍了如何确定启发式函数进行启发式搜索,并把A*算法用程序加以实现,从而证明A*算法可以解决游戏中的寻径问题-Map search technology to search from a map to the target point from the starting point of the path. Around the game routing proble
Knap
- 矩形条带装箱问题(RSPP)是指将一组矩形装入在一个宽度固定高度不限的矩形容器中,以期 获得最小装箱高度.RSPP理论上属于NP难问题,在新闻组版、布料下料以及金属切割等工业领域中 有着广泛的应用.为解决该问题,采用了一种混合算法,即将一种新的启发式算法—— 动态匹配算 法—— 与遗传算法结合起来.混合算法中,动态匹配算法能根据4类启发式规则动态选择与装填区域相 匹配的下一个待装矩形,同时将装箱后所需容器高度用遗传算法的
matrix
- heuristic algorithm for solving discrete optimization
981399TurboSimu
- 禁忌搜索的相关资料,对于启发式搜索很有帮助。大家可以-Tabu search-related information useful for heuristic search. We can see
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法,该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型,基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algo
GeneratingFPGA-AcceleratedDFTLibraries
- 关于DFT的文章,应用FPGA实现傅立叶变换。-Abstract—We present a domain-specific approach to generate high-performance hardware-software partitioned implementations of the discrete Fourier transform (DFT). The partitioning strategy i
6688252-SSD4Unit1
- Unit 1. Overview of User-Centered Design and Testing In this unit, we introduce the basic principles of user interface design. We cover two facets of UI design: the construction of interactive programs and the design