启发式方法

TextSplitter使用某些启发式方法消除了部分此类乱码，但是改进的splitter类将会使索引更接近恶性状况。

TextSplitter uses a few heuristics to eliminate quite a bit of this gibberish , but an improved splitter class would probably bring indexing much closer to the desired asymptotic behavior .

除了传统的运筹学方法，现代启发式方法正在得到越来越多的研究人员的关注和重视，已经广泛地应用于基础研究和实际工程领域。

In addition to traditional operations research , the modern heuristics have been attractive in fundamental research and real applications .

在Web使用挖掘的数据预处理阶段，提出了一种新的会话构造方法&基于时间和引用的启发式方法。

We give a novel session-constructed method , which is the Time-and-Referrer-based Heuristic Method .

这种启发式方法对于检测泄漏Java集合对象非常有效，这些对象使用一个内部数组来存储所包含的对象。

This heuristic is quite effective in detecting leaking Java collection objects that use an array internally , to store the contained objects .

在大量由IBM支持部门处理的内存泄漏案例中，已经发现这种启发式方法非常有效。

This heuristic has been found to be effective in a large number of memory leak cases handled in IBM Support .

这些问题都属于NP完全问题，往往都需要用只能得到近似解的启发式方法来解决。

Those problem are NP-complete , which are typically resolve with heuristic algorithms and the solution is approximate .

本文提出利用现代启发式方法中的粒子群优化算法（PSO）来解算无功优化问题。

In this paper , particle swarm optimization ( PSO ) was employed to deal with the problem of VAR planning .

因此，对NP类调度问题，一般采用启发式方法来求得满意解，常用优先规则法和一些专门调度算法。

So the heuristic methods are often applied to job shop scheduling such as priority rule method and special algorithms .

并用Project项目管理软件建立单项目和多项目案例，用两种启发式方法进行计算，比较不同情况下的计算结果性能，给出了理论分析。本文的研究将会为企业的生产管理提供理论依据。

Use the project management software to establish single project case and multi-project case , using two heuristic methods to calculate , and compare the results , this study will provide enterprises a theoretical basis for production management .

蚂蚁算法是一种相对较新的启发式方法，通过模拟蚂蚁的觅食行为，提出了求解Qos组播路由问题的改进蚂蚁算法。

The ant algorithm is a relatively new meta-heuristic algorithm . The paper proposed an improved ant system algorithm to solve the QoS multicast routing problem by simulating ants'foraging behavior .

由于构建最优的模糊决策树已被证明是NP-hard问题，因此，一般采用启发式方法来构建模糊决策树。

However , constructing the optimal fuzzy decision tree has been proved to be NP-hard , a heuristic algorithm is necessary .

对BobHanson的SudokuAssistant进行改编后，我们定义了9种可以用业务规则实现的可用来解决数独谜题的启发式方法。

As adapted from Bob Hanson 's Sudoku Assistant , we identify nine heuristics that will be implemented using business rules to solve Sudoku puzzles .

研究表明，寻找一条路径，使之满足两个或者多个路径约束条件属于NP完全问题，我们把约束条件按业务分级，并使用启发式方法来解决该问题。

It is a NP problem to find a routing according to two restrictions , the paper differentiates the two operations and apply heuristic technique to solve the problem .

受自然界和人类社会中智慧的启发，我们提出了有效地近似求解具有NP难度的圆形packing问题的启发式方法。

Inspired by the wisdom of the nature and the human society , we present heuristic methods to effectively provide approximate solutions to one of the NP-hard problems , the disks packing problem .

通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。

The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem . It is difficult to be solved by traditional methods .

ACO法来自对蚁群收集行为的研究，是一种求解组合最优问题的新型通用启发式方法。

ACO algorithm , derived from the study of the behavior of ant colonies , is a new general purpose heuristic algorithm for hard combinatorial optimization problems .

本文首先从QoS的概念出发，详细阐述了目前在QOS组播路由中存在的问题，研究了基于QoS的路由算法，提出了蚁群优化是一种用于求解复杂组合优化问题的启发式方法。

In this paper , starting from the concept of QoS in detail at the current Qos Multicast Routing Problems , research-based QoS routing algorithm , ant colony optimization is used for solving a complex combinatorial optimization problem inspired approach .

作为一种比较新颖的启发式方法，粒子群优化算法PSO搜索速度快、操作简单、效率高，能有效求解NP完全问题，被广泛应用于任务调度中。

As a new one , Particle swarm optimization , PSO , is widely used for tasks scheduling which has quick search speed , simple operation , high efficiency , and can efficency resolve the NP complete problem .

解列割集搜索问题是一个NP-hard问题，必须用启发式方法求解，现有方法计算时间长，难以满足在线应用要求。

Islanding cutset searching is a NP-hard problem , and heuristic approaches are employed to solve it . The approaches mentioned in literature need much calculation time , and can not be used online .

RMBRDM算法首先按照启发式方法选取标准维；

At first , RMBRDM employed heuristic methods to choose a standard dimension .

由于设备布局问题是NP完全问题，它在有限合理的时间内难以求得最优解，因此问题的求解只能依赖于各种启发式方法。

The machine layout problem is an NP-complete problem , it is very difficult , even impossible to find the optimum solution in a reasonable amount of time , so it can only be solved by use of the heuristic algorithms .

集装箱配装是个多约束的复杂组合优化问题，属于NP-Hard问题，其求解是很困难的，所以实际应用中一般多用启发式方法来解。

Container loading problem is a complicated combinatorial optimization problem with multiple constraints , and also is NP-Hard one . Generally it is difficult to obtain the optimal solution , so heuristics methods are usually employed in the application field .

在利用串行调度启发式方法解决资源受限的运输任务调度问题（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 ) .

对于该优化问题，一般采用遗传算法、模拟退火算法等启发式方法或者整数规划法、Benders解耦法等数学规划方法加以求解。

Generally the optimization problems are solved with help of heuristic methods , such as genetic algorithm ( GA ) and simulated algorithm ( SA ), or mathematical ones containing integer programming algorithm and Benders decomposition method .

在三维空间情况下，通过一种启发式方法的引入提取当前集合中的有效点，并利用这些有效点计算对应投影面上的Hypervolume指标值。

In three-dimensional case , a heuristic method is incorporated to extract efficient points from the whole set , which are used to calculate the hypervolume value on the plane of projection .

用启发式方法选择最合适的分子描述符并用于线性QSPR模型的建立，用径向基函数神经网络建立非线性模型，并对影响E1/2的结构因素进行了探讨。

Heuristic method ( HM ) was used to select the most appropriate molecular descriptors and a linear QSPR model was developed . Using the selected descriptors , radial basis function neural networks ( RBFNN ) was used in the non-linear model development .

对于变换后的数据，首先通过启发式方法确定模糊If-Then规则结论部分非模糊单值（即实数）的初始值，然后通过梯度下降学习方法进行精调。

For the transferred data , firstly , the initial value of fuzzy if then ruleswithnonfuzzysingletons ( i.e. , realnumbers ) in the consequent parts is generated by the heuristic method . Then , fine tuning is done by gradient descent learning algorithm .

由于神经网络启发式方法不存在计算时间复杂性问题，因此可望将此法用于预测SCFG等算法难以处理的大于1000个碱基的长RNA序列的折叠问题。

Since computational complexity for heuristic neural network approaches are relatively simple , the method can be used to solve secondary structure prediction problems of long RNA sequences with lengths greater than ( 1 000 ) nt , which are difficult with traditional folding algorithms .

多准则加工车间进度计划的启发式方法及其模拟实现

Heuristics and Simulation Realization for solving the multiple criteria production-scheduling problem

针对上述问题，目前解决的方法多为启发式方法。

Nowadays heuristic algorithms mostly are used to solve the problem .