搜索资源列表
2jinzhibindusaomiao
- 针对二进制病毒的启发式扫描技术 很不错的毕业论文。- In view of binary virus s heuristic scanning technology very good graduation thesis.
qifashiyichuansuanfa
- 启发式遗传算法组卷模型研究,启发式遗传算法组卷模型研究-heuristic genetic algorithms Test Paper Model, heuristic genetic algorithms Test Paper Model
cluster-hyper-dim
- 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 hist
HnSRTree-1.3.1.tar
- R 树， 存取方式的当中最普遍的的用长方形， 是根据区域的启发式优化围绕的长方形在各个内在结点通过运行在一张规范化的试验平台下高度变化的数据， 询问和操作众多的实验， 我们能设计合并联合的优化的R* 树区域， 各个附寄的长方形边际和交叠在目录使用我们规范化的试验床在详尽表现比较，它结果R* 树清楚地胜过现有的R 树变形Guttman’s线性和二次方R 树和R 树的格林变形，R* 树的这优势举行为不同的型询问和操作， 譬如地图覆盖物。 为两个长方形和多维点在所有实验从一个实用观点R* 树是非常有吸
Task
- 用状态空间法求解传教士-野人问题，设计启发式函数引导规则的选用。 通过设计，深入理解状态空间概念与启发式搜索技术，培养一般问题求解能力。-Using state space method for solving the missionaries- Yeti issues, design heuristic function to guide the selection of the rules. By design, in-depth understanding of the conc
C-W-savings-algorithm
- C-W节约算法是最经典的求解车辆路径问题的启发式算法。-The Clarke and Wright(1964) savings algorithm is perhaps the most widely known heuristic for the VRP.
0514003
- 根据汽车内饰等行业需求,对皮制品加工的优化排样问题进行了研究.创新地采用离散化处理方式,同时引进边界约束,使排样过程与皮料和样片的几何信息无关,使用基于顺序的启发式底左布局将样片顺次布置到皮料上-According to the demand for such industries as automotive interior trim, leather processing for optimal layout problem is studied. Innovative approach o
EmpiricalResearchofVolatilitySpillover
- 论文首先介绍了行为金融学对完全信息假设的摒弃。接着利用启发式判断准 则推断了波动传递的起源。同时跨市交易者无意中造成了波动的传递。最后详细 阐述了羊群行为的产生机理和市场表现，分析了羊群行为对波动溢出的放大效应。 -First of all papers presented on behavioral finance to abandon the assumption of complete information. Then infer the use of heuristic c
boundsonLDPCandLDGM
- The paper is about bounds for LDPC and LDGM codes under MAP. A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced. T
qifa
- nod32 的启发式分析，检测未知病毒技术的白皮书。-nod32 heuristic analysis to detect unknown virus technology, the White Paper.
rengongzhineng
- 野人过河问题，本实验研究了用人工智能的理论求解传教士(Missionaries)与野人(Cannibals)过河问题（M-C问题）。实验设计采用产生式系统的概念，将问题用状态空间表示，搜索技术采用状态空间启发式搜索的A算法，规则设计采用产生式规则，用C语言实现了A算法求解M-C问题，加深了对人工智能的认识与理解。-Savage river problems, this experimental study the theory of using artificial intelligence t
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 problem, describes how to determine
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 is a heuristic based on the DFT
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 of their behavior. The latter
444
- 启发式算法的简介 很有用 大家一起学习啊 一起讨论-About heuristic algorithm is useful to discuss with everyone learning ah
A-comparative-study-on-heuristic-algorithms-for-g
- A comparative study on heuristic algorithms for generating fuzzy decision trees
Heuristic-search-strategies
- IEEE文章，启发式搜索策略用于 确定最佳的电容布局和 供配电系统的评等。在启发式 方法提出了一个关键的少数 名为“敏感节点，节点，选择 安装电容器优化净储蓄 同时实现了大的整体亏损减少。 这种方法保证了电压约束 会见。这种启发式的方法是适合大 配电系统，并可以在网上有用 实施。该方法是 用于测试系统和结果 与其他已发表的技术。 -Heuristic search strategies are used to determine the o
The-new-meta-heuristic-algorithm-bat
- 摘要：新型元启发式算法例如粒子群算法，萤火虫算法，和声搜索算法已经成为现今复杂的优化问题的有效解决方法。该文基于蝙 蝠的回声定位行为提出了一种新型的元启发式算法———蝙蝠算法，同时也将现有的一些算法的优点引入到该算法中。 改文对该算 法进行了详细的公式化表述并对其执行流程的作出了说明，并且将该算法与遗传算法、粒子群优化算法等算法进行了比较。仿真结 果表明,蝙蝠算法明显优于其他算法，并对进一步的研究作出了展望。-Summary: The new meta-heuristic algor
heuristic
- Heuristic for flow shop
Heuristic-method-for-the-Traveling-Salesman-Probl
- Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.