Devise ef?cient algorithm for computing probability

Assignment Help Data Structure & Algorithms
Reference no: EM1364305

A mission-critical production system has n stages that have to be performed sequentially; stage i is performed by machine Mi.

Each machine Mi has a probability ri of functioning reliably and a probability (1 - ri) of failing (and the failures are independent). Therefore, if we implement each stage with the single machine, the probability that the whole system works is r1 × r2 × · · · × rn. To improve this probability we add redundancy, by having mi copies of the machine Mi so that stage i can be performed by mi independent copies. Each machine has a nonnegative cost ci, and there is a total budget B to buy machines.

Given the probabilities r1, · · · , rn, the costs c1, · · · , cn, and the budget B, ?nd the redundancies m1, · · · , mn that are within the available budget and that maximize the probability that the system works correctly. Devise an ef?cient algorithm.

You can assume the costs ci and the budget B are integers.

Reference no: EM1364305

Questions Cloud

Compute the break-even point in units : Shock Electronics sells portable heaters for $25 each unit, and the variable cost to produce them is $17. Mr. Amps estimates that the fixed expenses are $96,000.
What are the x-component and y-component of the velocity : What are the x-component and y-component of the velocity.
Role in health assessment and planning : Research plays an essential role in health assessment and planning. What is formative research?
Global business language evidence implications : Accounting is becoming a global business language. Provide some evidence of this assertion. What are some of the implications of this trend?
Devise ef?cient algorithm for computing probability : Given the probabilities r1, · · · , rn, the costs c1, · · · , cn, and the budget B, ?nd the redundancies m1, · · · , mn that are within the available budget and that maximize the probability that the system works correctly. Devise an ef?cient algo..
Illustrate what is the probability of seat belt usage : Out of the people who wear seat belts, northeast has 148. Out of the people who don't wear seat belts, northeast has 52. A total of 858 wear seatbelts in the United States. Illustrate what is the probability of seat belt usage by region of the cou..
Explain would your answer differ if you and your rival : Explain would your answer differ if you and your rival were required to resubmit price quotes year after year and if, in any given year, there was a 50 percent chance that Toyota would discontinue the Highlander.
What are the magnitude and direction of acceleration : what are the magnitude and direction of its acceleration. find out the magnitude of the charge on the moving particle.
Management discussion and analysis : Define the management's discussion and analysis. Describe in a memo, the major items disclosed in this section of the financial report.

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Determine the mean salary as well as the number of salaries

Determine the mean salary as well as the number of salaries.

  Primitives-remove ambiguities in algorithm-s representation

Describe how the use of primitives helps remove ambiguities in an algorithm's representation.

  Computing total number of keys needed in symmetric cipher

Determine the total number of keys that are needed for organization if symmetric cipher is used.

  Design algorithm to find the average miles per gallon

Design an algorithm to find the average miles per gallon. Sample data: 68723, 71289, 15.75, 16.30, 10.95, 20.65, 30.00.

  Computing time complexity of procedure

What is the time complexity of the procedure? If A[l .. r] = [24, 30, 09, 46, 15, 19, 29, 86,78], what is the output?

  Find cost of sorting the relation in seconds

Suppose you need to sort a relation of 40 gigabytes, with 4 kilobyte blocks, using a memory size of 40 megabytes. Find the cost of sorting the relation, in seconds, with bb = 1 and with bb = 100.

  Determine computational complexity of algorithm

Describe the algorithm in psuedo-code. You should give thought to what data structures(s) make sense for e client implementation. Determine computational complexity of your algorithm.

  Effective address-addressing mode of instruction is direct

Evaluate the effective address if the addressing mode of the instruction is (a) direct; (b) immediate; (c) relative; (d) register indirect.

  Recursive tree algorithms

Write a recursive function to determine if a binary tree is a binary search tree.

  Computing hash value for message

For a message, he computes the hash value H = (VChar 1 x VChar 2 x VChar 3 ...x VChar N) mod(26).

  Compare the average behavior of insertion sort

Compare the average behavior of insertion sort for n elements with that of the n insertions into an initially-empty straight array implementation of a priority queue

  Method singleparent returns number of nodes in binary tree

Write a method singleParent, which returns number of nodes in a binary tree that have only one child.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd