SANs are assumed a priori cumulative distribution function (c.d.f.). Normally distributed is proposed by Sculli [15] and Kamburowski [7], exponentially distributed is assumed by Kamburowski [8], Kulkarni and Adlakha [10] and Magott and Skudlarski [12]. Bendell et al [1] have considered the problem of using the Erlang distribution as a representation of activity times. Their method based on the ...

We present two new algorithms for Partially Observable Markov Decision Processes (pomdps). The first algorithm is a general grid-based algorithm for pomdps with theoretical optimality guarantees. The other algorithm is for the subclass of problems known as Stochastic Shortest-Path problems in belief space. Both algorithms are optimal and robust with respect to a novel robustness criterion that ...

We consider a class of stochastic growth models on the integer lattice which includes various interesting examples such as the number of open paths in oriented percolation and the binary contact path process. Under some mild assumptions, we show that the total mass of the process grows exponentially in time whenever it survives. More precisely, we prove that there exists an open path, oriented ...

The shortest path problem is solved and applied to the calculations of half lives with respect to spontaneous fission of heavy nuclei. The dynamical programming method of Bellman and Kalaba is used to find the fission path in the d-dimensional space of deformation parameters. Fission half lives of heavy isotopes (100<Z<110) are shown and compared to the experimental data. 1. Introductory remark...

This paper is focussed on algorithms to solve the k-shortest path problem. Three codes were described and compared on rand and grid networks using random generators available on http://www.dis.uniroma1.it/∼challenge9 Codes were also tested on the USA road networks available on the same URL address. One million paths were ranked in less than 3 seconds on random instances with 10 000 nodes and 10...

This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...

In this paper, we consider Dijkstra’s algorithm for the single source single target shortest path problem in large sparse graphs. The goal is to reduce the response time for on-line queries by using precomputed information. Due to the size of the graph, preprocessing space requirements can be only linear in the number of nodes. We assume that a layout of the graph is given. In the preprocessing...

This document describes the QSPN, the routing discovery algorithm used by Netsukuku. Through a deductive analysis the main proprieties of the QSPN are shown. Moreover, a second version of the algorithm, is presented. i ar X iv :0 70 5. 08 17 v1 [ cs .N I] 6 M ay 2 00 7 This document is part of Netsukuku. Copyright c ©2007 Andrea Lo Pumo aka AlpT . All rights reserved. This do...

In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra’s shortest path algorithm. In this context, we show that studying heuristics that are efficient in practice can yield interesting clues to the combinatorial properties...

Exact implementations of algorithms of computational geometry are subject to exponential growth in running time and space. This exponential growth arises when the algorithms are cascaded: the output of one algorithm becomes the input to the next. Cascading is a signiicant problem in practice. We propose a geometric rounding technique: shortest path rounding. Shortest path rounding trades accura...