Cart (Loading....) | Create Account
Close category search window
 

Stochastic Allocation and System Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Klinger, Allen ; Computer Science Department, University of California, Los Angeles, Calif. 90024

The optimum allocation of a fixed stock of unreliable units to a random number of demands is discussed. The demands occur at Poisson times; several types of criteria are described, but the most important optimum presented is of the probability that at least one allotted unit does not fail at every Poisson demand. Hence this concerns how unreliable elements can best be used to create a reliable system. The allocation problem arose in a military system analysis context. The results presented exemplify how system science concepts (Poisson models, recursive computation, and cost/ benefit comparisons) and current computing tools can be applied to practical problems.

Published in:

Systems Science and Cybernetics, IEEE Transactions on  (Volume:5 ,  Issue: 3 )

Date of Publication:

July 1969

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.