The sensitivity analysis of systems' characteristics to the shape of distributions is a very important task of reliability engineering of stochastic systems and networks. One of the earliest result concerning inse...
详细信息
The sensitivity analysis of systems' characteristics to the shape of distributions is a very important task of reliability engineering of stochastic systems and networks. One of the earliest result concerning insensitivity of systems' characteristics to the shape of service time distribution was obtained in case of Erlang's formulas for loss queues with Poisson arrival stream, where steady-state distribution dep.nds only on the mean service times. The paper deals with simple finite-source queueing models which comp.etely fail if a source area becomes empty. The inter-arrival or service times are assumed to be generally distributed. It is shown that the steady-state probabilities of the systems with a buffer or with generally distributed inter-arrival times are sensitive to the shape of distributions but simultaneously the waiting time distributions have a weak sensitivity. It was observed that the sensitivity vanishes if the comp.ete failure becomes a rare event. The results are comp.red with loss queues.
When choosing a numerical method to approximate the solution of a continuous math.matical problem, we need to consider which method results in an approximation that is not only close to the solution of the original pr...
详细信息
Two algorithms are presented for comp.ting shortest paths in the plane avoiding convex polygonal obstacles. For the first algorithm, the obstacles are assumed to consist of f disjoint convex polygons; for the second a...
详细信息
Two algorithms are presented for comp.ting shortest paths in the plane avoiding convex polygonal obstacles. For the first algorithm, the obstacles are assumed to consist of f disjoint convex polygons; for the second algorithm, the boundaries of the f polygons may intersect pairwise at most twice. For finding the shortest path between two arbitrary query points, the first algorithm takes O(fn log n) time and O(n) space, the second algorithm preprocesses the polygons in O(n log n + f super(3)) time and O(n + f super(2)) space. Thereafter, one query takes O(n log n + f super(2)) time.
暂无评论