1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive integers X = {x1, x2, .. . , xn}. Find a subset P of the set X such that the sum of the elements of P is equal to 21. For example, if N=5 and the set X = the set P = {12, 3, 6} is a valid solution for the subset21 problem in this example. {12, 17, 3, 24, 6}, Formulate the subset21 problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example (i.e. X = {12, 17, 3, 24, 6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subset21 problem if possible without run-

1. [20 points] [MID] The subset21 problem is stated as follows. Given a set of N positive integers X = {x1, x2, .. . , xn}. Find a subset P of the set X such that the sum of the elements of P is equal to 21. For example, if N=5 and the set X = the set P = {12, 3, 6} is a valid solution for the subset21 problem in this example. {12, 17, 3, 24, 6}, Formulate the subset21 problem as a Genetic or Evolutionary Algorithm optimization. You may use binary representation, OR any representation that you think is more appropriate. you should specify: • A fitness function. Give 3 examples of individuals and their fitness values if you are solving the above example (i.e. X = {12, 17, 3, 24, 6}). • A set of mutation and/or crossover and/or repair operators. Intelligent operators that are suitable for this particular domain will earn more credit. • A termination criterion for the evolutionary optimization which insures that you terminate with a valid solution for the subset21 problem if possible without run-

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Is A a subset of B if; A = { 9, 8, 7, 6, 5} B ={ 5,6, 7, 8, 9}
The rook is a chess piece that may move any number of spaces either horizontally or vertically. Consider the “rooks problem” where we try to place 8 rooks on an 8x8 chess board in such a way that no pair attacks each other. a. How many different solutions are there to this?b. Suppose we place the rooks on the board one by one, and we care about the order in which we put them on the board. We still cannot place them in ways that attack each other. How many different full sequences of placing the rooks (ending in one of the solutions from a) are there?
List down the elements of the following sets: {x ∈ ℤ : -2 ≤ x <7}
Question- Single Source Shortest PathA team sport game has m players in a team and a tournament can have n competing teams. Team ?1 can stand in front of team ?2 if there is a way such that every member of ?1 in a row is shorter than a corresponding member of ?2.(1) Give an example of four 3 member teams such that three teams can properly stand in three rows, and the fourth team does not fit (you can use a tuple of heights to represent a team);(2) Design an efficient algorithm (pseudo code) to determine whether or not two teams ?1 and ?2 can stand in front of one another;(3) Given ?? teams {?1,?2,…,??}, abstract the team standing problem as a graph;(4) Design an efficient algorithm (pseudo code) to find the longest sequence <??1,??2,…,???> of teams such that ??? stands in front of ???+1 for ?=1,2,…,?−1; and analyze the time complexity of your algorithm in terms of ? and ?
I need the answer as soon as possible
Please help me with this practice problem in python : Implement two-level iterative method B = B_{TL} for graph Laplacian matrices. We want the symmetric B. Components: Given a graph, construct its graph Laplacian matrix. Then using Luby's algorithm, construct the P matrix that ensures a prescribed coarsening factor, e.g., 2, 4, or 8 times smaller number of coarse vertices. Since the graph Laplacian matrix is singular (it has the constants in its nullspace), to make it invertible, make its last row and columns zero, but keep the diagonal as it were (nonzero). The resulting modified graph Laplacian matrix A is invertible and s.p.d.. Form the coarse matrix A_c = P^TAP. To implement symmetric two-level cycle use one of the following M and M^T: (i) M is forward Gauss-Seidel, M^T - backward Gauss-Seidel (both corresponding to A) (ii) M = M^T - the ell_1 smoother. Compare the performance (convergence properties in terms of number of iterations) of B w.r.t. just using the smoother M…
You are given a multiset S. Over all pairs of subsets A and B, such that: • BC A; |B| = |A| – 1; greatest common divisor of all elements in A is equal to one; - find the sum of ErEA r · EnER x, modulo 998 244 353. x€A x€B Input The first line contains one integer m (1 < m < 10°): the number of different values in the multiset S. Each of the next m lines contains two integers a;, freq; ( 1< a; < 10°, 1 < freq; < 10°). Element a; appears in the multiset S freq; times. All a; are different. Output Print the required sum, modulo 998 244 353.
Let the domain be the set of all positive integers. Let: P(x): " is a perfect square". Q(z): "z is a perfect cube". Determine if the following quantified statement is true or false: 3r (Q(x) ^ P(x))
Q8
Question 3 Please answer them correctly
Q8. Consider the lattice defined by the following basis: [1, 4]" and [3, 7]". Find: (a) A shortest non-zero vector in this lattice (b) A vector closest to [20, 21]"
5) Find three subsets of {1, 2, 3, 4, 5, 6, 7, 8, 9} such that the intersection of any two has size 2 and the intersection of all three has size 1.