Access over 20 million homework & study documents
search

Consider the following 4 jobs to be scheduled to a single machine S

Content type

User Generated

Rating

Showing Page:
1/3
Consider the following 4 jobs to be scheduled to a single
machine. Schedule these four jobs to minimize the total
tardiness on single processer using Tabu Search
Algorithm. Get the initial list according to EDD based on
d_1 provided. Write the TS algorithm step by step for
guiding the coding in any programming language.
Consider the following 3-layer Neural Network with 2 input
neurons. 2 output neurons and 3 hidden neurons. Input,
output and weights are given on the network. Use the
sigmoid function as an activation function. The learning
rate is h = 0.1. Use the backpropagation algorithm to
determine the revised weights for NN. Make the calculation
for two passes.
Solution
import java.util.Scanner; public class
FloydWarshall { private int distancematrix[][];
private int numberofvertices; public static final int
INFINITY = 999; public FloydWarshall(int
numberofvertices) { distancematrix = new
int[numberofvertices + 1][numberofvertices + 1];
this.numberofvertices = numberofvertices; }
public void floydwarshall(int adjacencymatrix[][]) {
for (int source = 1; source <= numberofvertices; source++)
{ for (int destination = 1; destination <=
numberofvertices; destination++) {

Sign up to view the full document!

lock_open Sign Up
Showing Page:
2/3
distancematrix[source][destination] =
adjacencymatrix[source][destination]; } }
for (int intermediate = 1; intermediate <= numberofvertices;
intermediate++) { for (int source = 1;
source <= numberofvertices; source++) {
for (int destination = 1; destination <= numberofvertices;
destination++) { if
(distancematrix[source][intermediate] +
distancematrix[intermediate][destination]
< distancematrix[source][destination])
distancematrix[source][destination] =
distancematrix[source][intermediate]
+ distancematrix[intermediate][destination]; }
} } for (int source = 1; source <=
numberofvertices; source++)
System.out.print(\"\\t\" + source);
System.out.println(); for (int source = 1; source <=
numberofvertices; source++) {
System.out.print(source + \"\\t\"); for (int
destination = 1; destination <= numberofvertices;
destination++) {
System.out.print(distancematrix[source][destination] +
\"\\t\"); } System.out.println(); }
} public static void main(String... arg) {
int adjacency_matrix[][]; int numberofvertices;

Sign up to view the full document!

lock_open Sign Up
Showing Page:
3/3

Sign up to view the full document!

lock_open Sign Up

Unformatted Attachment Preview

Consider the following 4 jobs to be scheduled to a single machine. Schedule these four jobs to minimize the total tardiness on single processer using Tabu Search Algorithm. Get the initial list according to EDD based on d_1 provided. Write the TS algori thm step by step for guiding the coding in any programming language. Consider the following 3-layer Neural Network with 2 input neurons. 2 output neurons and 3 hidden neurons. Input, output and weights are given on the network. Use the sigmoid function as an activation function. The learning rate is h = 0.1. Use the backpropagation algorithm to determine the revised weights for NN. Make the calculation for two passes. Solution import java.util.Scanner; FloydWarshall { public class private int distancematrix[][]; private int numberofvertices; INFINITY = 999; numberofvertices) public static final int public FloydWarshall(int { dist ...
Purchase document to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Anonymous
Really great stuff, couldn't ask for more.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4