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.

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.

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.

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.

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.

With this method users could characterize the shape of silhouette as the scope for branching, then the whole tree can be automatically built in the way of the shortest distance and fractal method,while imitating phototropism.

This paper studies the distance analysis based on the 3D raster,and proposes an algorithm about the shortest distance.

This solved the difficulties above greatly and made two more complicated problems: the shortest path problem and the shortest distance pro.