Skip to main content
SpringerLink
Log in

A one-sided stochastic model of search problem

  • Published:
Trabajos de estadistica y de investigacion operativa

Abstract

The underlying process is a cyclic, 3 State Semi Markov with general holding time distributions. The supplementary variable technique [1] has been employed to solve the model. The generating functions of the State probabilities have been obtained in terms of Laplace transforms [2]. In the end, it is shown that the limiting probabilities of the system in 3-State are proportional to the mean holding times in corresponding States, from which the asymptotic rate of scoring hits is obtained for a particular case.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

  1. Keilson, J. and Kooharian, A.: “On time dependent queuing processes”. Analysis of Mathematical Statistics, 31 (1960).

  2. Widder, D. V.: “The Laplace transforms” Princeton University, Princeton N. J. (1941).

    Google Scholar 

  3. Cox D. R.: “Renewal Theory” (London, Methuen’s, 1962).

    MATH  Google Scholar 

  4. Mohan C, Arora, S. D., J.R.N.S.S., 18, 5 (1964).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dte of Scientific Evaluation Ministry of Defence, New Delhi, (India)

    S. D. Arora

Authors
  1. S. D. Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arora, S.D. A one-sided stochastic model of search problem. Trab. Estad. Invest. Oper. 21, 75–80 (1970). https://doi.org/10.1007/BF03028507

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03028507

Keywords

Search

Navigation