启发式搜索

应用启发式搜索求解同顺序3×n排序问题

The Heuristic Search Methods in the 3 × n Sequencing Problem

启发式搜索在时间Petri网的共享资源调度中的应用

Heuristic Search Applied in Scheduling Shared Resources of the Timed Petri Net

描述了如何使用面向对象语言Java来设计启发式搜索算法。

The paper describes how to design heuristic searching algorithm by using object-oriented language Java .

禁忌搜索算法（TabuSearch，TS）是一种亚启发式搜索算法。

Tabu search ( TS ) algorithm is a meta-heuristic algorithm .

最后用MATLAB编程验证启发式搜索算法特征选择的有效性。

The program of MATLAB proves the availability of heuristic search algorithm for selecting the optimal feature subset .

在分析了迭代加深启发式搜索（IterativeDeepeningA）算法及其可并行性后，提出了一种新的基于混合负载平衡的并行迭代加深启发式搜索算法。

This paper presents a new parallel iterative deepening A searching algorithm by discussing iterative deepening A algorithm and its parallel properties .

本文提出了模糊广义与或图FAOG的线性存贮空间的模糊启发式搜索算法LFAO~（FAO~withLinearSpace）。算法LFAO~是算法FAO~的改进算法，它不仅具有可采纳性，而且存贮空间是线性的。

Presents the improved admissible algorithm LFAO ( FAO with linear Space ) of fuzzy heuristic search algorithm FAO .

LISP跳棋程序与启发式搜索

A Chinese Checkers-Playing Program in LISP and Heuristic Search

基于PVM的启发式搜索的并行计算模型设计

Design of Heuristic Parallel Computation Model Based on PVM

模S下的AND/OR图的启发式搜索算法NAO

And / or graph heuristic search algorithm Nao based on norm s

该算法应用启发式搜索策略，计算出多条满足QoS要求的路由，并根据实际网络负载情况自适应调整路由策略、动态选路，以平衡网络负载，减少网络局部拥塞。

Using heuristic searching strategy , this algorithm can find multiple routes meeting QoS need , adjust self-adaptively and route dynamically according to the actual network load .

利用支配关系的定义证明Pareto适应度函数判断非支配点的有效性，并在此基础上结合序列近似模型技术和启发式搜索算法研究了两种基于Pareto解集的多目标优化方法。

Two Pareto multi-objective optimization methods are put forward by combined the sequence approximate model technology and heuristic search algorithm .

本文利用Web网页分布群聚性的特点，结合巩固学习方法，提出了一种新的启发式搜索算法。

Based on the survey of current intelligent search engine , combined with reinforcement learning technique , the characteristic of similar web pages ' distribution is used to present a heuristic search algorithm based on simulated annealing .

随后通过引入启发式搜索思想及PageRank技术对算法进行了改进。

We made improvements to the algorithm by using Heuristic search and PageRank technology .

本文推广启发式搜索算法公式，提出了一种基于费用和延迟的加权启发式QoS路由选择算法。

In this paper , the formula of heuristic search algorithms is generalized , and a weighted heuristic QoS routing selection algorithm based on cost and delay is presented .

用正交交叉算子代替传统的算术交叉算子；利用agent间的竞争作用与每个agent所具有的知识和自学习能力进行启发式搜索，以提高进化的速度。

An orthogonal crossover operator instead of arithmetic crossover operator is adopted and heuristic search is implemented by using the competition between agents and the knowledge and self-learning ability of each agent to accelerate the convergent speed .

首先，利用启发式搜索算法，得到优化的基于RBF核函数和多项式核函数支持向量机子模型。

Firstly , a heuristic searching algorithm is presented , which is valuable for getting the support vector machines submodels based on RBF and polynomial kernel functions .

具有线性存储空间的启发式搜索算法SRA

Heuristic Search Algorithm SRA With Linear Space

通过对GIS中最短路径理论和实现算法的分析和研究，该文对传统的Dijkstra算法和启发式搜索算法A算法进行了详细的探讨，并说明了各自的特点及适用条件。

First , with the analysis and research on the shortest path theory and implementation algorithm , the paper explains elaborately the traditional Dijkstra algorithm and A algorithm .

免疫遗传算法IGA（ImmuneGeneticAlgorithm）是借鉴生命科学中免疫的概念与理论提出的一种智能算法，它将免疫机理引入基本遗传算法（SimpleGeneticAlgorithm），是一种启发式搜索算法。

Immune Genetic Algorithm , IGA , is one of intelligent Algorithms that being brought forward from immune conception and theory in life sciences . It is a heuristic Algorithm that the immune mechanism is introduced into simple genetic algorithm .

特征子集选择问题是机器学习的重要问题.而最优特征子集的选择是NP困难问题，因此需要启发式搜索指导求解。

The feature subset selection is an important problem in machine learning , but the optimal feature subset selection is proves to be a NP hard one .

该爬虫的搜索算法是对Authoritiesandhubs算法的改进，采用了Web超链接分析和网页文本内容相结合的启发式搜索策略。

This crawler uses the search algorithm both based on Web hyperlink structure and page content , and improves on Authorities and hubs algorithm . The details of structure and design are introduced .

提出一种高效的机器人相平面建模方法.此方法采用B样条曲线构成路径，依据B样条曲线参数划分相平面，利用运动约束限制建模区域，为启发式搜索提供启发信息以加快搜索进程。

A high efficiency phase plane modeling method of robot is presented , which constructs path using B spline , divides phase plane by parameter of B spline , confines modeling region by motion constraints , and provides heuristic information for speeding up searching procedure .

本文提出了三种启发式搜索策略：（1）最大似然优先搜索（MLF）；

Three heuristic search algorithms are proposed : ( 1 ) Maximum Likelihood First ( MLF ) search ;

本文提出一个新的启发式搜索算法，它可以在搜索过程中不断改善启发函数h，使最坏复杂度降为O（N）（N是被搜索图的大小）。

In this paper . a new heuristic search algorithm is presented . It is able to improve the heuristic function during the searching and it has an O ( N ) worst-case complexity ( N is the size of the graph searched ) .

设施区位的计算问题是属于NP完全问题，其大规模的最优化问题还是很难解决的，我们采用了启发式搜索法来求解此类问题。

The computation of facility location belongs to NP hard problems , so it is difficult to solve its calculation of large scale . We use the heuristic algorithm to solve this problem .

研究了CADCAM集成系统中孔加工刀具路径的优化问题，利用图论中旅行商问题的数学模型，采用启发式搜索算法，对加工中心上多孔加工刀具路径进行了优化。

The optimization of tool path of holes manufacturing in CAD / CAM system is investigated . Utilizing classical " Traveling Salesman Issue " mathematical model , tool path for manufacturing many holes in machining center is optimized with heuristic searching arithmetic .

其次，采用TOC理论确定企业生产的约束条件，确定企业运行的目标函数，建立启发式搜索编排的3大规则；

Then , according to the theory of constraints ( TOC ), the constraint items and target function of corporation runing are defined and three rules of Heuristic Algorithm are described .

通过道路分类，逐层寻优的指导思想对原有最优路径搜索算法进行了改进，并结合启发式搜索策略和GIS功能，实现了问题的求解。

Guided by the idea of by path classification , search optimal route layer by layer , the existing optimal route search algorithms are improved . The solution to optimal route problem has been given by combining with heuristic search strategy and GIS function .

在分析、评价常用主题搜索ROBOT爬行策略的基础上，将三重过滤技术与改进的Shark启发式搜索算法相结合，设计了自动主题搜索引擎ROBOT的综合爬行策略。

Based on analyzing and evaluating on strategies of subject searching ROBOT in common use , an auto integrative crawling strategy of subject searching ROBOT was designed by combing treble filtrating technique with modified heuristic searching arithmetic of Shark in this paper .