在启发式评估过程中，当评估者更多的是在关注发现新的可用性问题时，要获得一个较好的严重性评估是比较困难的。
It is difficult to get good severity estimates from the evaluators during a heuristic evaluation session when they are more focused on finding new usability problems.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
由于该问题是NP -完备的，我们给出了一个启发式算法。
Because of NP property, we will propose an heuristic algorithm to solve the problem.
文章针对基于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.
研究了单抓钩动态排序的问题，提出一个启发式算法，该算法是通过解一系列静态问题来解动态问题的。
This paper studies the dynamic hoist scheduling problem and proposes a heuristic method, which method solves the dynamic problem through the solution of a series of static problems.
相似度量通常不详细描述问题和对应方案之间的依赖，仅仅表示启发式经验。
Similarity measures usually do not describe the dependencies between problems and corresponding solutions in detail, but only represent a form of a heuristics.
各种启发式是指那些心理经验之谈，是那些在解决问题或做出决定时应用上的快捷、常识性的规则。
Heuristics are mental rules of thumb, the quick, common-sense principles you apply to solve a problem or make a decision.
视图校正技术是帮助开发者为特定问题定制软件过程的一种启发式方法。
View alignment techniques is a kind of enlightened method which helps developers to customize software development process for special problem.
但是属性约简是一个NP问题，对属性的约简和决策规则的约简只能通过启发式算法实现。
But the attribute reduction is a NP problem, the attribution reduction and decision rule reduction will be solved by method of elicitation.
提出了解决这类问题的新的启发式优化算法。
A new heuristic optimization algorithm for solving the problem was presented.
另外，利用这种启发式信息，提出了一种解决噪音问题的方法。
Additionally, using the heuristic information, this paper proposes a solving data noise problem method.
高等数学课堂教学中问题情境的设置是启发式教学思想应用于实际的中间桥梁，是教学中的重要环节。
Question circumstances setting in the course of Higher Mathematics teaching is a key link between the teaching ideas of elicitation method and practical application.
启发式概率估计是当前国外自然推理研究的新兴的热点问题之一。
Heuristic probability estimate is one of the popular issue of natural reasoning in foreign psychological research currently.
启发式算法利用与所求问题有关的某些特殊信息来控制搜索状态空间的过程。
By the use of some special information related to problems to be solved, the heuristic algorithm controls the process of searching state space.
本文提出组密钥分发的最小准确覆盖问题，并证明一种启发式的解。
In this paper, Minimum Exact Cover Problem (MECP) for key distribution is presented, and a heuristic solution is testified.
提出了一套解决钢管生产中短尺合同和非定尺合同组批优化问题的启发式算法。
A series of heuristic algorithms was designed to solve problems in optimization of short and unfixed order-grouping in steel tube production.
提出了一种解决有时间窗口装卸货问题(PDPTW)的快速启发式算法。
A quick heuristic algorithm is proposed to solve the pickup and delivery problem with time Windows (PDPTW).
在利用串行调度启发式方法解决资源受限的运输任务调度问题（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).
为了解决单机总误工问题，提出了一种分解启发式算法。
A decomposition heuristic algorithm was developed to solve the single machine total tardiness problem.
采用双层规划模型描述弹性需求条件下的连续平衡网络设计问题，设计了近似解的启发式算法。
A bilevel programming model and heuristic solution algorithm is proposed to model the continuous equilibrium network design problem with elastic demand.
该文提出了一种求解集成电路模块布局问题的启发式算法。
Experimental results demonstrate that the algorithm, though simple, is quite effective in solving the LSI block placement problem.
以前，许多研究都集中在采用启发式算法来求解该问题。
Thus, most previous researchers have focused on developing heuristic algorithms to solve the problem.
本文给出了一种解“时间表问题”的启发式算法，从整个时间表的生成过程来说，它是一种并行和无回溯的方法；
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.
特征子集选择问题是机器学习的重要问题。而最优特征子集的选择是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.
特征子集选择问题是机器学习的重要问题。而最优特征子集的选择是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.
应用推荐