## Applied Probability-Computer Science: The Interface, Volume 1 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

SERVER QUEUE WITH CONSTANT SERVICE TIMES AND | 31 |

SIMULATION OUTPUT ANALYSIS FOR GENERAL STATE SPACE MARKOV | 71 |

MODELS AND PROBLEMS OF DYNAMIC MEMORY ALLOCATION | 89 |

Copyright | |

18 other sections not shown

### Other editions - View all

Applied Probability- Computer Science: The Interface Ralph L. Disney,Teunis J. Ott No preview available - 2014 |

### Common terms and phrases

allocation approximation arrival process arrival rates arrival-stationary behavior Bell Laboratories Bell Telephone Laboratories Bellman equation blocks Chandy closed network Computer Science computer systems conformable aggregate consider Convolution defined denote discussed dynamic programming element equivalence class error evaluation example exponential finite follows Formula Franken function given input invariant measure iterative Lavenberg linear Markov chain Markov process Markovian matrix Q mean-value analysis memory method monotone property Networks of Queues Neuts normalizing constant number of customers obtain optimal parameter partition performance measures point process Poisson process probabilistic algorithms probability vector problem product form Proof quasi-reversible node queue length queueing system queueing theory Quicksort r e R(L random recursion Reiser Research Section Semi-Markov Processes service center simulation solution stationary distribution stationary probability stochastic matrix subnetwork theorem throughputs time-stationary transition rates University VMPP