基本释义:

最短的处理时间

网络释义

1)shortest processing time,最短的处理时间

2)SPT (shortest processing time),最短的处理时间

3)minimum length,最短

4)shortest path,最短路径

5)shortcut,最短行程

6)shortcut,最短路径

7)shortest distance,最短距离

8)shortest route,最短路径

9)shortcut,最短路线

10)minimum distance,最短距离

用法和例句

Based on the definition of the confidence interval, using the methed of numerical calculation, the minimum length of confidence interval for the variance of the normal distribution are found.

99,在样本容量n从3到30的范围内,在正态总体均值未知的情形下,求得了方差σ2的最短置信区间,并对用通常方法求得的置信区间的长度与最短置信区间的长度进行了对比分析。

Briefly on the shortest path algorithm in the urban road network;

浅析城市道路网中的最短路径算法

The Realization of Shortest Path Algorithm in Traffic System;

最短路径搜索算法在交通系统上的应用

Study on the multi-modal shortest path in time-varying network;

时变网络下多式联运的最短路径问题研究

Cause analysis of improvedalgorithm of shortcut onselecting the favorite line;

浅析航线选择中的改进最短路径算法

The Improved Shortcut Algorithm and It s Application in Selecting Ship s Optimum Route;

改进最短路径算法在最佳航线选择中的应用

An applied algorithm of searching shortcut quickly;

一种实用的最短路径求解算法

Based on the shortest distance between the cylinder cutter axis and surrounding surface, the maximum gouging was obtained by comparing with the radius of cutter.

提出的柱刀干涉检测是基于最短距离的求取算法,获得刀轴与加工面间的最短距离,进而与刀具半径比较得到最大干涉量。

The paper construct the specimen of multi-dimensional space based on the definition of clustering,calculate the generator control sensitive to load and the Eulerian distance,partition the power system by the shortest distance method of clustering analysis.

根据聚类的定义构造了多维空间的样本集,计算发电机节点对负荷节点的控制灵敏度和各负荷节点间的欧氏距离,利用聚类分析中的最短距离法对电力系统进行分区。

By improving Dijkstra s algorithm,the Dijkstra s matrix algorithm,which is to calculate the shortest distance between two arbitrary vertexes in a weighted graph is proposed.

介绍了Dijkstra算法,对Dijkstra算法进行改进,提出了计算加权图中任意两点之间最短距离的算法——Dijkstra矩阵算法,给出了Dijkstra矩阵算法在Matlab语言中的实现,对一个具体例子,应用Dijkstra矩阵算法进行了验算。

Use Dynamic Programming Theories to Search the Shortest Route in the Transportation;

在交通运输上使用动态规划求解最短路径

When we calculate the shortest route of the network by classical Dijkstra arithmetic,we need to calculate the route-lengths between nodal points which are unrelated to the shortest routes.

经典Dijkstra算法在求解最短网络中两点间最短路径时,需要计算大量与最短路径无关的结点间的路径,占用了大量计算机的内存。

The key to get the minimum distance between two points on the curved surface is to choice the shortest route in the surface.

求两点沿曲面最小距离的关键是正确选择两点间沿曲面的最短路径。

A algorithm of solving shortcut is obtained through applying the kind of automata to the problem of solving shortcut of dynamic programming.

提出了取值于非负实数R~+的模糊自动机的概念,研究了它的一些简单性质,并将此类自动机应用到动态规划的求解最短路线问题中,得到了一个求最短路线的算法。

A new selection of the typical day based on the analysis of minimum distance cluster and interconnect degree theory;

一种基于最短距离聚类与关联度分析的典型日选取新方法

An algorithm for quickly calculating the minimum distance between a space point and a surface;

一种快速求取空间点到曲面最短距离的算法

According to the differential characteristics of free surface, the minimum distance between the part and the tool can be calculated rapidly after the tracking direction and step length being determined, then the interfer.

然后利用自由曲面的微分特性,确定跟踪方向和步长,迅速计算出工件和刀具的最短距离,从而判断是否发生干涉。