Genetic Algorithm with Mutation
Not what you're looking for?
A genetic algorithm uses the following mutation operator: the bits in the input string are considered one by one independently, with probability 0.01 that each bit is inverted.
Given that you apply the mutation operator to the string (0 0 0 0), what is the probability that the output is:
(0 0 0 0)?
(0 1 0 0)?
(1 0 1 0)?
(1 1 1 1)?
Show the process of your computation.
Purchase this Solution
Solution Summary
This solution shows how to calculate the probability of a certain output for a genetic algorithm with a mutation operator.
Solution Preview
As background, if events A and B are independent, then the chance the A and B both happen is P(A)*P(B).
In this problem, we are told that each input bit is considered independently, and has a 0.01 chance of being flipped. So for example, the chance that '0' would ...
Purchase this Solution
Free BrainMass Quizzes
Breastfeeding Basics
How much do you know about breastfeeding? Find out with this quiz!
Vision and Oculomotor Control
This quiz will test the student's knowledge of the neural underpinnings of the visual system and its central pathways.
Cellular Respiration
This quiz is a review for cellular respiration.
Breast Milk and Breastfeeding
How much do you know about breast milk and breastfeeding? Double check your knowledge level with this quiz!
Identifying Variables in Science Experiments, Part 2
Using sample experiments, test yourself to see if you can identify independent, dependent, and controlled variables. Identifying variables is key in understanding and developing experiments. The questions are biology related, but this can be applied to any area of science.