Computers and Technology, 20.03.2020 17:46, hma9153

You are given some data to analyze. You can spend D dollars to perform the analysis. You have organized the process of analyzing the data so that it consists of n tasks that have to be performed sequentially by using dedicated hardware: you will use a processor P; to perform task i, for every i. Each processor is relatively cheap but may fail to complete its task with some probability, independently of the other processors. Specifically, P; costs ci dollars and succeeds to complete its task with probability si, while it fails with probability 1 - si.

(a) (3 points) What is the probability that the process of analyzing the data will be com- pleted successfully?

(b) Note that you can improve this success probability by using Pi identical processors Pi for task i instead of just one.

i. (8 points) What is the probability that task i will be completed successfully now?

ii. (4 points) What is the probability that the process of analyzing the data will be completed successfully?

iii. (25 points) Given 81,..., Sn, integers c1, ..., Cn and integer D, give an algorithm to compute p1, ...,Pn such that the success probability of the entire process is maxi- mized while you do not spend more than D dollars. Your algorithm should run in time polynomial in n and D.

Answers: 2

Show answers

Other questions on the subject: Computers and Technology

Computers and Technology, 22.06.2019 07:00, Jasten

For all machines-not just hammers- the user applies force force to the machine to the machine over a certain distance. a. input b. output c. duo d. none of the above

Answers: 1

continue

Computers and Technology, 22.06.2019 13:50, juan3937

The instruction ishl (shift left integer) exists in jvm but not in ijvm. it uses the top two values on the stack, replacing the two with a single value, the result. the sec- ond-from-top word of the stack is the operand to be shifted. its content is shifted left by a value between 0 and 31, inclusive, depending on the value of the 5 least signifi- cant bits of the top word on the stack (the other 27 bits of the top word are ignored). zeros are shifted in from the right for as many bits as the shift count. the opcode for ishl is 120 (0x78).a. what is the arithmetic operation equivalent to shifting left with a count of 2? b. extend the microcode to include this instruction as a part of ijv.

Answers: 1

continue

Computers and Technology, 23.06.2019 21:00, shyshy1791

Which set of steps will organize the data to only show foods with more than 100 calories and rank their sugar content from greatest to least?

Answers: 1

continue

Computers and Technology, 23.06.2019 21:30, mariah10455

Write a fragment of code that reads in strings from standard input, until end-of-file and prints to standard output the largest value. you may assume there is at least one value. (cascading/streaming logic, basic string processing)

Answers: 3

continue

Do you know the correct answer?

You are given some data to analyze. You can spend D dollars to perform the analysis. You have organi...