An Average Length of Computations of Normalized Probabilistic Algorithms

Karbowska-Chilinska, Joanna

doi:10.1007/978-0-387-36503-9_21

Cited by 1 publication

(2 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such approach to the programs with continuous time parameter allows us to estimate the average computation time by applying the method from discrete time case [3].…”

Section: The Average Time Of Normalized Probabilistic Algorithm Compumentioning

confidence: 99%

See 1 more Smart Citation

Estimation of the Average Time of Computations of Probabilistic Algorithms with Continuous Time Parameter

Karbowska-Chilinska

2007

6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)

View full text Add to dashboard Cite

In this paper computations of iterative probabilistic programs with continuous time parameter are investigated. The main goal is to propose a new method of determining the average time of probabilistic programs computations. Programs with continuous time parameter are considered as finite Markov processes. Therefore in the first method we use the popular solution based on Markov Process Theory. This method gives the precise results however its computational complexity is high. The second method is our original solution. We restrict number of a program states using the corresponding probabilistic program with discrete time parameter. Therefore we can use the estimation of the average computations time applied in discrete time case based on a transformation of a probabilistic program to the form with only one loop (a normal form).

show abstract

“…Such approach to the programs with continuous time parameter allows us to estimate the average computation time by applying the method from discrete time case [3].…”

Section: The Average Time Of Normalized Probabilistic Algorithm Compumentioning

confidence: 99%

“…The remaining part of the paper is organized as follows: in the next section two types of language semantics in discrete time case (algebraic semantics [1], [4] and computational semantics [3]) are presented. In the third section the semantics of probabilistic algorithms in continuous time case is described.…”

Section: Introductionmentioning

confidence: 99%

Estimation of the Average Time of Computations of Probabilistic Algorithms with Continuous Time Parameter

Karbowska-Chilinska

2007

6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)

View full text Add to dashboard Cite

show abstract

An Average Length of Computations of Normalized Probabilistic Algorithms

Cited by 1 publication

References 2 publications

Estimation of the Average Time of Computations of Probabilistic Algorithms with Continuous Time Parameter

Estimation of the Average Time of Computations of Probabilistic Algorithms with Continuous Time Parameter

Contact Info

Product

Resources

About