查询词典 shortest confidence interval

Secondly, geodesic Gaussian basis functions are defined on the graph. A shortest path obtained by a shortest path faster algorithm is used to approximate a geodesic distance.

其次，在图上定义测地高斯基函数，并用基于最短路径快速算法得到的最短路径来逼近测地线距离。

Shortest path Hamiltonian path and can be obtained over the shortest path and Hamiltonian path.

最短路径和哈密顿通路，可以求得多条最短路径和哈密顿通路。

Not considering the restriction of the depot s transporting ability in the existing achievement of emergency dispatch, consequently, this chapter establishes a sole-resource optimized dispatch model aimed at "the shortest dispatch time" which includes the constraint of transporting ability under time restriction firstly. Moreover, the chapter deduces the algorithm of the model by mathematical induction step by step. Secondl y, it simplifies the former model and gives a simpler sole-objective model and corresponding algorithm including the constraint of transporting ability. At last, on the basis of the improved model, this chapter discusses a two-phase programming model and a multi-objective programming model which are aimed at "the shortest dispatch time" and "the fewest number of mobilized depots" including the constraint of transporting ability under time restriction.

由于现有应急调运的研究成果中没有考虑到各物资供应点受运输能力的约束，因此本章首先建立限制期内以"应急调运时间最短"为目标且含有运输能力约束的单物资调运优化模型：并利用逐步递推法推导出具体的求解算法；然后，进一步地将此模型及算法进行简化，建立更加简单的含有运输能力约束的单目标优化模型：并且讨论其算法；最后，在改进的优化模型的基础上，讨论限制期内含有运输能力约束且以"调运时间最短"、"出动的供应点数目最少"为目标的双层规划及多目标规划的优化模型及解法。

Open Shortest Path First is a routing protocol developed for Internet Protocol networks by the Interior Gateway Protocol working group of the Internet Engineering Task Force. The working group was formed in 1988 to design an IGP based on the Shortest Path First algorithm for use in the Internet.

最短路径优先是Internet 任务工程组的一个工作组为IP网络开发的一个内部网关路由选择协议，该工作小组成立于1988年并致力于为INTERNET应用设计一个基于最短路径优先算法的内部网关路由协议。

How to provide route to meet the driver's multiple psychological expectations is the key problem of navigation system. The essence of this problem is resource constrained shortest path problem, which belongs to NP-C problems and can not be solved with the traditional shortest path algorithm.

提供满足驾驶员多个心理期望的路径是导航系统该解决的关键问题，其本质是资源约束最短路径问题，属于NP难问题，无法使用传统的最短路径算法解决。

According to disadvantage of AS that the speed low of convergentiss and easily entering the stagnation,improving the AS in some aspect by the way that importing pheromone windows that the value of pheromone cannot exceed the window,only deposit the pheromone on the edge that belongs to the iteration shortest solution path,releasing additional pheromone to the edge belongs to the so-far shortest solution path,judging the situation of convergent and to reinitialize pheromone,optimizing the solutions by local search procedure at the end of every iteration,modifying the transition probability by add some problem specific parameters and so on.

本文主要运用蚁群优化算法(Ant Colony Optimization，ACO)来求解VRP。针对蚁群算法收敛性比较差，易于停滞的缺陷，通过使用信息素窗口限制、信息素的最大最小值，只更新信息素迭代中最好解，增加了精英的蚂蚁，信息素重新初始化之前先判断出汇聚情况，在每次迭代过程中加入局部的搜索进行优化，在对蚁群算法进行了优化时考虑选择概率当中加入与问题的相关参数等措施，从而使蚁群算法的收敛性得到大大提高，避免了算法的停滞现象。

The shortest path approximation algorithm builds a weighted graph from the given set of scattered points using the distribution of these data points. By computing the shortest path in the weighted graph, the problem of curve reconstruction from scattered data points is transformed into that of curve reconstruction from a set of ordered data points.

最短路逼近算法首次将图论中最短路径理论引入到曲线重建中，根据散乱数据点的分布构造带权连通图，通过求解带权连通图的最短路径，将散乱数据点集的曲线重建问题转化为有序数据点集的曲线重建问题。

Firstly, we use the algorithm of Dijkstra in shortest path problem to find the paths of shortest cutting in stone material industry.

首先，利用最短路问题的Dijkstra算法，找出了石材切割的最优切割路径。

The main target of emergent material transport is to transport the emergent vehicles to the demand point in the shortest time. The core of this research is the problem of shortest route selection.

应急物资调运主要是应急车辆在最短的时间内把应急物资运送到需求点，其研究的核心是最短路径选择问题。

This can be established without a map to the right, then seeking the shortest route into the problem for a map of the rest of Vertex Vertex all the shortest path probl

这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶点的最短路径问题了。

Article 144 The Government of the Hong Kong Special Administrative Region shall maintain the policy previously practised in Hong Kong in respect of subventions for non-governmental organizations in fields such as education, medicine and health, culture, art, recreation, sports, social welfare and social

第一百四十四条香港特别行政区政府保持原在香港实行的对教育、医疗卫生、文化、艺术、康乐、体育、社会福利、社会工作等方面的民间团体机构的资助政策。原在香港各资助机构任职的人员均可根据原有制度继续受聘。

Small wonder, then, that the Chinese spend more in the shop than any other group of foreign visitors do .

这样的小惊喜，使中国顾客比任何国家的人消费得更多。