Мобильная версия

Доступно журналов:

2 361

Доступно статей:

3 493 662

 
Расширенный поиск

Cambridge University Press по журналам "Probability in the Engineering and Informational Sciences"

Описание

Отсортировать по: Порядок: Результаты:

  • A Band and Bound Technique for Simple Random Algorithms
    Rego Vernon (Cambridge University Press. New York, USA, 1990-07-01)
    A simple random algorithm (SRA) is an algorithm whose behavior is governed by a first-order Markov chain. The expected time complexity of an SRA, given its initial state, is essentially the time to absorption of the ...
  • A Bayesian Approach to Simulated Annealing
    Van Laarhoven P.J.M.; Boender C.G.E.; Aarts E.H.L.; Kan A. H. G. Rinnooy (Cambridge University Press. New York, USA, 1989-10-01)
    Simulated annealing is a probabilistic algorithm for approximately solving large combinatorial optimization problems. The algorithm can mathematically be described as the generation of a series of Markov chains, in which ...
  • A Bound on the Rate of Convergence for the Discrete Gibbs Sampler
    Dinwoodie I. H. (Cambridge University Press. New York, USA, 1995-04-01)
    We give a computable bound on the rate of convergence of the occupation measure for the Gibbs sampler to the stationary distribution.
  • Accelerated Regeneration for Markov Chain Simulations
    Andradóttir Sigrún; Calvin James M.; Glynn Peter W. (Cambridge University Press. New York, USA, 1995-10-01)
    This paper describes a generalization of the classical regenerative method of simulation output analysis. Instead of blocking a generated sample path on returns to a fixed return state, a more general scheme to randomly ...
  • A Characterization of Lindley and Singpurwalla's Bivariate Lomax Distribution
    Roy Dilip (Cambridge University Press. New York, USA, 1990-10-01)
    Bivariate Lomax distribution due to Lindley and Singpurwalla has been characterized through the bivariate extension of a univariate characterizing property of the Lomax distribution.
  • A Class of Decision Processes Showing Policy-Improvement/Newton–Raphson Equivalence
    Whittle P. (Cambridge University Press. New York, USA, 1989-07-01)
    A condition expressed in Eq. (7) is given which, with one simplifying regularity condition, ensures that the policy-improvement algorithm is equivalent to application of the Newton–Raphson algorithm to an optimality ...
  • A Convexity Property of a Markov-Modulated Queueing Loss System
    Du Charles; Pinedo Michael (Cambridge University Press. New York, USA, 1995-04-01)
    In this note we consider a single-server queueing loss system with zero buffer. The arrival process is a nonstationary Markov-modulated Poisson process. The arrival process in state i is Poisson with rate λi. The process ...
  • A Coupling Proof of the Asymptotic Normality of the Permutation Oscillation
    Angus John E. (Cambridge University Press. New York, USA, 1995-10-01)
    For each n ≥ 1, let Πn = (π1, π2, …, πn) be a random permutation of the integers 1,2, …, n. The quantity Bn = Σ measures the degree of oscillation of Πn and is an important measure in the study of sorting algorithms. In ...
  • Active Redundancy Allocation in Coherent Systems
    Boland Philip J.; Neweihi Emad El; Proschan Frank (Cambridge University Press. New York, USA, 1988-07-01)
    We introduce in this paper a new measure of component importance, called redundancy importance, in coherent systems. It is a measure of importance for the situation in which an active redundancy is to be made in a coherent ...
  • ACTIVE REDUNDANCY ALLOCATIONS IN SERIES SYSTEMS
    Misra Neeraj; Misra Amit Kumar; Dhariyal Ishwari Dutt (Cambridge University Press. New York, USA, 2011-03-01)
    We consider the problem of optimally allocating one/two active spares in series systems. Lifetimes of different configurations are compared with respect to the reversed failure rate order, the failure rate order, the ...
  • ACTIVE REDUNDANCY ALLOCATIONS IN SERIES SYSTEMS
    Misra Neeraj; Misra Amit Kumar; Dhariyal Ishwari Dutt (Cambridge University Press. New York, USA, 2011-03-01)
    We consider the problem of optimally allocating one/two active spares in series systems. Lifetimes of different configurations are compared with respect to the reversed failure rate order, the failure rate order, the ...
  • A Diffusion Model for a System Subject to Continuous Wear
    Baxter Laurence A.; Lee Eui Yong (Cambridge University Press. New York, USA, 1987-10-01)
    A model for a system whose state changes continuously with time is introduced. It is assumed that the system is modeled by Brownian motion with negative drift and an absorbing barrier at the origin. A repairman arrives ...
  • A Direct Approximation for the Percentiles of the t Distribution
    Lin Jinn-Tyan (Cambridge University Press. New York, USA, 1994-07-01)
    In contrast to the usual approach of using a normalizing transformation, a direct approximation for the percentiles of the t distribution is developed by using techniques of exploratory data analysis. The approximation is ...
  • A Discounted-Cost Continuous-Time Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time*
    Eaves B. Curtis; Rothblum Uriel G. (Cambridge University Press. New York, USA, 1995-01-01)
    A discounted-cost, continuous-time, infinite-horizon version of a flexible manufacturing and operator scheduling model is solved. The solution procedure is to convexify the discrete operator-assignment constraints to obtain ...
  • A Double Band Control Policy of a Brownian Perishable Inventory System
    Perry David (Cambridge University Press. New York, USA, 1997-07-01)
    The blood bank system is a typical example of a perishable inventory system. The commodity arrival and customer demand processes are stochastic. However, the stored items have a constant lifetime. In this study, we introduce ...
  • A Full-Information Best-Choice Problem with Allowance
    Tamaki Mitsushi; Shanthikumar J. George (Cambridge University Press. New York, USA, 1996-01-01)
    This paper considers a variation of the classical full-information best-choice problem. The problem allows success to be obtained even when the best item is not selected, provided the item that is selected is within the ...
  • A Functional Equation Arising in a Queue With a Gating Mechanism
    Jagerman David L.; Sengupta Bhaskar (Cambridge University Press. New York, USA, 1989-07-01)
    Our primary aim in this paper is to study a functional equation that arises in a problem of queueing. Consider a queue with compound Poisson arrivals and general service times with a gating mechanism. The gating mechanism ...
  • Ageing Characteristics of the Weibull Mixtures
    Gupta Pushpa L.; Gupta Ramesh C. (Cambridge University Press. New York, USA, 1996-10-01)
    It is well known that mixtures of decreasing failure rate (DFR) distributions have the DFR property. A similar result is, of course, not true for increasing failure rate (IFR) distributions. In a recent note, Gurland and ...
  • A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering
    frenk J. B. G. (Cambridge University Press. New York, USA, 1991-07-01)
    In this paper we present a general framework for stochastic one-machine scheduling problems with zero release times and no partial ordering and review and extend some of the results for nonpreemptive permutation schedules ...
  • A Generalized Age-Replacement Model
    Vanneste Stephan G. (Cambridge University Press. New York, USA, 1992-10-01)
    Four practically important extensions of the classical age-replacement problem are analyzed using Markov decision theory: (1) opportunity maintenance, (2) imperfect repair, (3) non-zero repair times, and (4) Markov degradation ...