Construct a magic square using a genetic algorithm

Assignment Help Data Structure & Algorithms
Reference no: EM13811503

1. Use a genetic algorithm to train a feed forward neural network with one hidden layer and unipolar discrete (sgn) activation function to classify characters: A,..., E.

2. The construction of a magic square using genetic algorithms.

A magic square of order n is an arrangement of the numbers from 1 to n2 in an n-by-n matrix, with each number occurring exactly once, so that each row, each column, and each main diagonal has the same sum.

Construct a magic square using a genetic algorithm. First, generate an initial population of magic squares with random values. The fitness of each individual square is calculated based on the "flatness", that is, the degree of deviation in the sums of the rows, columns, and diagonals.

Reference no: EM13811503

Questions Cloud

What is the firms required rate of return : Cooley Company's stock has a beta of 1.40, the risk-free rate is 4.25%, and the market risk premium is 5.50%. What is the firm's required rate of return?
Discuss about equal access to healthcare : Equal Access to Healthcare
Yield to maturity remains at its current rate : A 25-year, $1,000 par value bond has an 8.5% annual payment coupon. The bond currently sells for $925. If the yield to maturity remains at its current rate, what will the price be 5 years from now?
Construct a magic square using a genetic algorithm : Construct a magic square using a genetic algorithm. First, generate an initial population of magic squares with random values. The fitness of each individual square is calculated based on the "flatness", that is, the degree of deviation in the sum..
The largest percentage increase in price : Assume that all interest rates in the economy decline from 10% to 9%. Which of the following bonds would have the largest percentage increase in price?
Assume that the risk-free rate is a constant : If the market risk premium increases by 1%, then the required return will increase for stocks that have a beta greater than 1.0, but it will decrease for stocks that have a beta less than 1.0. The effect of a change in the market risk premium depends..
How is channel coding done : Select a particular standard of interest to research. The 802.x ones tend to be documented the best. Complete the following for your individual project: How is channel coding done
What is the bonds nominal coupon interest rate : O'Brien Ltd.'s outstanding bonds have a $1,000 par value, and they mature in 25 years. Their nominal yield to maturity is 9.25%, they pay interest semi annually, and they sell at a price of $975. What is the bond's nominal coupon interest rate?

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Calculate the wait time between two iterations

Question on Retry factor and Retry and Retry Interval, practical question is asked on this to calculate the wait time between two iterations?

  Creating a flowchart

Create a flowchart to illustrate the given problem. You are given input for the student name, number of credits, and cost per credit.

  Write a program to find average marks

Write a program to find average marks obtained by 10 students in a test along with algorithm and write a menu driven program using function to perform following operations on 1 d array?

  1 for a 77t truck with gross vehicle weight gvw of 136078

1. for a 77t truck with gross vehicle weight gvw of 136078 kg with dual rear tyres and a tyre inflation pressure is 120

  Solving single source shortest paths problem

Here is a proposed algorithm to solve single source shortest paths problem in a weighted directed graph G with possibly negative edges weights.

  Data structures and algorithm design

Data Structures and Algorithm Design

  Dynamic-programming algorithm for rod-cutting problem

Consider a modification of the rod-cutting problem in which, in addition to a price pi for each rod, each cut incurs a fixed cost of c. Give a dynamic-programming algorithm to solve this modified problem.

  Empty stack

1. Suppose an initially empty stack S has performed a total of 25 push operations, 12 top operations, and 10 pop operations, 3 of which generated EmptyStackExceptions, which were caught and ignored. What is the current size of S?

  Explaining view of header and footer areas of worksheet

In which view can you see header and footer areas of worksheet?

  What is the time complexity of running the below bubblesort

Show a simple modification that can be made to the below bubblesort that significantly improves the time complexity for an array of sequential integers.

  Nbspa stack evaluating the postfix expression lrm using

nbspa stack evaluating the postfix expression lrm using linked list implementationthis step will use the queue

  Efficient algorithm to achieve goal using few base stations

Certain points along the road, so that every house is within four miles of one of the base stations. Give an efficient algorithm that achieves this goal using as few base stations as possible.

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