查询词典 hard-to-reach

However, you can be hard up for time or for work, too.

这也是应该的。对了，Larry，这个hard up除了指缺钱，还可以用在什么地方？

He TSP is one of the typical NP-hard problems in combinatorial optimization problem.

SP问题是最经典的NP-hard组合优化问题之一。

the container loading problem with wide practical application is a combinatorial optimization problem, and is np-hard problem.

集装箱装载问题是一种有广泛应用背景的组合优化问题，它属于np-hard问题。

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

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

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

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

Routes with the largest and most difficult runouts have always been reserved for the top climbers of any generation; modern examples include the Bachar-Yerian of Tuolumne Meadows, the hard routes on Gritstone in England's Peak District (made famous in the movie Hard Grit), and the sandstone towers of the Elbesandstein area in Saxony (along the German-Czech border).

不管在哪个攀登世代，只有该世代最顶尖的攀登者能够攀登最大最难的这类路线；比如在Tuolumne Meadows的Bachar-Yerian路线(位於Yosemite National Park)、Gritstone的困难路线(England Peak district，因电影Hard Grit而闻名)、位於Saxony的Elbesandstein区域的沙质岩塔。

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。

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

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

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大相互边相交硅钛路径。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。