The novel online heuristic algorithm of representation based on polygonal boundary reduction is presented in detail.
提出了一种新颖的可在线计算的时间序列启发式算法。
A new heuristic density-based ant colony clustering algorithm (HDACC) is presented.
提出一种基于密度的启发性群体智能聚类算法。
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.
文章针对基于JIT思想建立的一种批量计划和作业排序集成问题，建立整体模型，设计了一种启发式算法采用集成方法求求解。
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.
特征权重学习是基于特征赋权的K近邻算法需要解决的重要问题之一，传统上提出了许多启发式的学习方法。
Based on the complexity of solving the model, two heuristic algorithm is proposed accordingly.
基于求解该模型的复杂性，进而提出了相应的两种启发式解法。
Based on the idea of repeated matching and clustering arithmetic, the heuristic rules and heuristic algorithm for packing and scheduling problem are put forward.
利用重复匹配算法、聚合算法等启发式方法，提出了布局调度操作的启发式规则及相应的启发式算法。
The model was resolved with heuristic algorithm based on Tabu search technique.
利用禁忌搜索技术设计启发式算法对模型求解。
In this paper, we propose a new attributes reduction algorithm based on the significance of attribute dependencies as heuristic information and add a certain variable precision.
粗糙集理论是一种新的数据挖掘算法，文章以属性依赖重要性作为启发信息提出了一种新的属性约简算法，且加入了一定的分类正确度。
Based on these, an ICMP based algorithm of heuristic Intra-AS network topology probe is put forward and realized. Then, the complexity of the algorithm is analyzed.
在此基础上，提出基于ICMP的启发式网络层拓扑探测算法，并对算法进行了复杂性分析和性能测试。
In this paper we study heuristic algorithm for restoration based on DXC and optimal assignment of spare capacity.
本文重点讨论基于DXC的启发式网络恢复算法和备用容量的优化分配问题。
Based on the search technique of non-monotone heuristic simulated annealing proposed, the algorithm realizes fast search of network weight and parameter.
该算法运用该文提出的非单调启发式模拟退火搜索法实现网络权值和参数的快速搜索。
A heuristic algorithm based on conditional information entropy for knowledge reduction is proposed, and the complexity of this algorithm is analyzed.
提出了一种基于条件信息熵的知识约简启发式算法，并指出该算法的时间复杂度是多项式的。
Through the problem of lossy links inference is mapped to minimal set-cover problem, the algorithm based on heuristic strategy is proposed.
通过将失效链路推断问题映射为最小集合覆盖问题，提出了一种基于启发策略的失效链路推断算法。
A classification algorithm based on explanation could be put into the category of heuristic classification in knowledge engineering.
基于解释的分类算法可纳入知识工程中启发式分类的范畴。
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.
为了有效地搜索到刀具交换问题的优化解，本文提出了基于定向搜索的启发式算法的求解方法。
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).
在利用串行调度启发式方法解决资源受限的运输任务调度问题（RCTTSP）的基础之上，提出了一种混合遗传算法（HGA）。
Constrained two-dimensional stock cutting algorithm based on heuristic regulation is given in this paper.
本文提出了基于启发式规则的有限制二维板材下料算法。
The algorithm consists of two parts: a heuristic enclosed contour searching algorithm and a rule based depth fill-in algorithm.
该算法由启发式封闭轮廓搜索算法和基于规则的深度填充算法两部分组成。
The experimental results show that the scheduling algorithm based on multiobjective combinational optimization method is better than those heuristic scheduling algorithms.
仿真实验结果表明，基于多目标优化方法的调度算法在多数性能指标上均比启发式调度算法更具优势。
The paper offer a new heuristic attribute reduction algorithm based on conditional granularity entropy, though running an example, we show that this algorithm is effective.
提出了一种基于条件粒度熵的属性约简的启发式算法，通过例子分析，表明该算法是有效的。
In order to improve the search efficiency, this paper presents an optimization solution based on heuristic search algorithm and applies it in the original system successfully.
针对该问题，提出基于启发式搜索算法的查询优化方案并成功应用于原有的查询系统。
Through improving and extending the process of computing core, the minimal reduction algorithm based on attribute frequency heuristic information are put forward.
对分辨矩阵求核过程进行改进与扩展，给出了一种以属性频度作为启发式信息计算最小约简快速完备方法。
After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial.
再次，对有序决策表进行了研究，提出了一种基于优势矩阵的启发式属性约简算法。
A route-based variational inequality model and a heuristic algorithm of the dynamic user optimal route choice problem were proposed by the link travel time function.
运用该阻抗函数建立基于路径的动态用户最优路径选择变分不等式模型，给出了该模型的启发式算法。
A route-based variational inequality model and a heuristic algorithm of the dynamic user optimal route choice problem were proposed by the link travel time function.
运用该阻抗函数建立基于路径的动态用户最优路径选择变分不等式模型，给出了该模型的启发式算法。
应用推荐