查询词典 hard-on

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问题。

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

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

This paper presented a three-phase heuristic approach to deal with this NP-hard problem. During the process of determining the bottleneck work center, arranging the devices, and ordering the jobs, reduced the complexity of the problem gradually. Therefore obtained an effective solution within polynomial time.

针对这个NP-hard问题，提出一种三阶段启发式方法，通过依次完成瓶颈工作中心的判定、设备分配和任务排序，使这一问题的复杂度得以逐步降低，从而可以在多项式时间内得到有效的调度方案。

All his showiest roles point to a sense of innate superiority, from the terrorist Hans Gruber in Die Hard and the Sheriff of Nottingham in Robin Hood : Prince Of Thieves to the megalomaniacal Rasputin in the film of the same name and the disdainful Professor Severus Snape, scourge of the schoolboy wizard, in the Harry Potter films.

他那些最精彩的角色无不表现出他那种天生的优越，比如 Die Hard 中的 Hans ，或者是 Robin Hood 中的诺丁汉郡长和同名电影中的 Rasputin ，还有哈里波特电影中那个小魔法师们的噩梦，不可一世的 Severus Snape 教授。

Given a graph G representing a network topology, and a collection T ={(s1 , t1 )...} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NP-hard problem that consists in determining the maximum number of pairs inT that can be routed in G by mutually edge-disjoint si ti paths.

由于图G代表的网络拓扑，并且收藏笔=( S1及T1期……的顶点G大代表连接请求，最大边不相交的路径问题是一个NP-hard问题，它包括确定最多偶笔可以改为G大相互边相交硅钛路径。

Although the disperse model is beautiful and sententiously, the problem is NP-hard problem, when the number of aminophenol is very huge, the style of the difficulty of settle the problem is exponential, solving the problem is impossible.

离散模型固然很简洁优美，但是蛋白质结构的预测问题是NP-HARD问题，当蛋白质一维氨基酸序列的链长n很大的时候，计算时间随着问题规模的增加呈指数方式增长，求解将变得非常困难。

As she looked at Warrington's manly face, and dark, melancholy eyes, she had settled in her mind that he must have been the victim of an unhappy attachment.

每逢看到沃林顿那刚毅的脸，那乌黑、忧郁的眼睛，她便会相信，他一定作过不幸的爱情的受害者。

Maybe they'll disappear into a pothole.

也许他们将在壶穴里消失