在接下来的文章中，我们将考察算法方法，在这种方法中，第三方使用结构和启发式技术从为人设计的HTML网页导出机器可读的语义。
In the next article, we'll examine the algorithmic approach, in which third parties use structural and heuristic techniques to derive machine-readable semantics from HTML Web pages targeted at people.
应用传统的算法和启发式方法很难维护，因为随着时间的推移，系统的性能下降使系统变得难以控制。
Traditional methods of applying dedicated algorithms and heuristics result in hard to maintain, unwieldy systems with performance degradation over time.
混合遗传算法在产生初始种群时引入启发式方法，采用自适应遗传参数和交替使用两种交叉算子；
In the HGA , heuristic algorithm is used to produced initial population , self-adaptive parameter are used in copy operator, crossover operator and mutation operator .
文章针对基于JIT思想建立的一种批量计划和作业排序集成问题，建立整体模型，设计了一种启发式算法采用集成方法求求解。
A monolithic model of the lot-sizing and scheduling problem based on the JIT strategy has been proposed in this paper, and a heuristic algorithm using integrated method has been designed to solve it.
对于某些难于用理论方法解决的问题，启发式算法可以起到独到的作用。
The heuristic algorithm will play an original role in solving certain problems which can't be done by theoretical methods.
实验结果表明：提出的算法比现有的遗传算法以及传统的启发式方法提供了较好的结果。
The experimental results show that the proposed algorithm has a better performance than those of a traditional heuristic algorithm and an existing evolutionary algorithm.
特征权重学习是基于特征赋权的K近邻算法需要解决的重要问题之一，传统上提出了许多启发式的学习方法。
Feature weighting is one of the important problems for feature weighting based KNN algorithm, and many heuristic methods have been employed to solve the problem traditionally.
详细研究了启发式搜索算法的产生、构造方法、基本类型等几个方面。
The study includes the generation, construction methods and basic types of heuristics search algorithms.
在利用串行调度启发式方法解决资源受限的运输任务调度问题（RCTTSP）的基础之上，提出了一种混合遗传算法（HGA）。
This paper proposes a Hybrid Genetic Algorithm(HGA) based on a serial scheduling heuristic method to solve the Resource-Constrained Transport Task Scheduling Problem(RCTTSP).
仿真实验结果表明，基于多目标优化方法的调度算法在多数性能指标上均比启发式调度算法更具优势。
The experimental results show that the scheduling algorithm based on multiobjective combinational optimization method is better than those heuristic scheduling algorithms.
解决这类问题的一般方法是采用启发式算法求出最优或次最优约简。
The common method to solve this problem is to adopt the heuristic algorithm.
本文给出了一种解“时间表问题”的启发式算法，从整个时间表的生成过程来说，它是一种并行和无回溯的方法；
This paper presents a heuristic algorithm to solve the time tabling problem, which is a parallel and no-go-back method and uses a improved Tabu eearch to get daily feasible timetable.
应用模拟退火方法并结合启发式算法，给出了求解该模型的一种新方法。
A new approach to solve the problem by combining the heuristic algorithm with simulated annealing approach is presented.
提出了一种基于F M算法的启发式电路划分新方法。
A new heuristic circuit partitioning approach based on F-M algorithm is presented in this paper.
利用重复匹配算法、聚合算法等启发式方法，提出了布局调度操作的启发式规则及相应的启发式算法。
Based on the idea of repeated matching and clustering arithmetic, the heuristic rules and heuristic algorithm for packing and scheduling problem are put forward.
为了有效地搜索到刀具交换问题的优化解，本文提出了基于定向搜索的启发式算法的求解方法。
In order to search for the optimizing solutions of tool switching problem effectively, a beam search based heuristic algorithm is put forward for formulating heuristic solution space of the problem.
实验结果表明，与传统的启发式方法相比，基于本文所提出的图论模型而采用的神经网络方法是一种简单、快速、高效的算法。
The experimental results show that the neural network method based on the graph model is an effective algorithm compared with heuristics algorithm.
在综合分析路径规划研究的基础上，采用基于概率地图的路径规划方法，运用启发式搜索算法对水果收获机器人机械臂运动路径进行实时规划。
In research of path planning of fruit picking robot the probabilistic roadmap method is adopted to achieve on-line planning with heuristic search arithmetic.
有各种不同的方法，包括数学规划，启发式算法，并基于加权属性值多目标。
There are different kinds of methods, including mathematical programming, heuristic algorithms, and multi-objective based on weighted attribute values.
提出一种改进的蚁群算法，并将其与启发式方法相结合以解决多点路由问题。
In this paper, the performance of as is improved and the improved as is combined with the heuristic algorithm to solve the multicast routing problem.
阐述割平面方法、整基方法、枚举和启发式方法和逼近算法。
Develops cutting plane methods, integral basis methods, enumerative and heuristic methods and approximation algorithms.
为解决二维矩形布局问题，在广泛研究各种启发式方法的基础上，提出了基于目标的启发式算法。
Based on extensive researches on various heuristic methods, an objective-based heuristic algorithm was developed to solve the 2d rectangle packing problem.
为解决二维矩形布局问题，在广泛研究各种启发式方法的基础上，提出了基于目标的启发式算法。
Based on extensive researches on various heuristic methods, an objective-based heuristic algorithm was developed to solve the 2d rectangle packing problem.
应用推荐