查询词典 hard-bitten

Vehicle routing problem with time windows is a NP-hard problem in combinatorial optimization field.

有时间窗的车辆路径问题属于组合优化领域中的NP-hard问题。

His parents give him a short-wave radio so he can talk to his pals, but instead he sets up shop as pirate deejay Hard Harry, who becomes a hero to his peers while inspiring the wrath of the local high school principal.

他的父母给了他一个无线电广播设备，他可以通过它向外广播，他用Hard Harry这个名字建立了一个地下电台，每天深夜向同为高中生的听众广播，很快的他成为了同龄人眼中的英雄，与此同时也触怒了当地高校的校长。

Owing to the strong condition of equivalence relation, there exist some limits, and It has been proved to be NP-Hard to find all reductions and a minimal reduction.

由于等价关系条件较强，有一定的局限性，已经证明求所有约简和最小约简是NP-Hard问题。

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

I had always told him that it was a 'gateway' drug and that statistics showed that most hard drug users began by smoking cannabis.

我不止一次告诉他，吸大麻是吸毒的第一步，科学分析大部分HARD 毒品分子一开始都是从吸大麻开始的。

But it's hard-core.

但这是hard-core。

The problem of finite precision multiuser decorrelator is formulated as linear bounded integer optimization problem,and the problem is shown to be NP-hard problem.

该文首先分析了应用有限精度序列为解相关矩阵序列的解相关接收机，将有限精度解相关的多用户检测问题归约为线性约束整数优化问题，同时证明此问题为NP-hard问题。

Since the model is a large scale and NP-hard combinational optimization problem in the real navigation environment, a hybrid simulated annealing algorithm is employed to search the suboptimal solution composed of a lockage timetable and a ship scheduling, The search starts by trimming the existing lockage timetable based on heuristic rules; the result is then used to compute the ship scheduling by the depth-first-search algorithm. The obtained solution is finally updated by the Metropolis rule.

本文首先提出了该问题的混合整数非线性规划模型，在实际通航调度环境中，该模型属于强NP-hard复杂度的大规模组合优化问题，因此设计了一种混合模拟退火算法来搜索次优化调度方案，该算法将解分解为闸次时间表和船舶调度计划两部分，在搜索过程中用启发式规则对闸次时间表进行调整，然后用深度优先搜索算法根据闸次时间表求解船舶调度计划，最后根据Metropolis规则对当前解进行更新。

This paper studies the distributed partition problem of Web Services composition and proves that it is NP-Hard.

本文证明了将Web服务组合分布式划分到不同节点上，在不同的划分中，求得吞吐量最佳的划分问题是一个NP-Hard问题。

As an NP-hard problem, this model has no solution based on polynomial algorithm at present. Therefore, an adaptive and polymorphic ant colony algorithm has been brought forward to solve the VRPMC.

由于该模型是一个NP-hard问题，目前还没有多项式算法求解，又提出了采用自适应的多态蚁群算法来对其进行求解的策略。

So that more consumers can enjoy more delicious quality, technology is even better than wine.

让更多的消费者可以品尝到品质更为鲜美，工艺更为精湛的葡萄酒。

Open it in your favorite text editor .

在你最喜爱的文本编辑器中将它打开。