aparna990 Goto Github PK

algorithm-comparison

A repository containing the implementation of two heuristic algorithms solving the University Timetabling Problem, as a part of a Degree Project at KTH.

class-scheduling-genetic-algo

course-scheduling

Solving scheduling problem with local search algorithms

cpsolver

Local-search based solver of Constraint Satisfaction and Optimization Problems

examination-scheduling

Examination scheduling using Particle Swarm Intelligence

final-exam-scheduler

Using genetic algorithm, simulated annealing and brute force to solve final exam scheduling problem.

first-repo

fp-growth-java

An implementation of FP-Growth algorithm in Java

ga-for-moo

Genetic Algorithms for Multi Objective Optimization

genetic-algorithms-in-java-basics

hades

A hybrid Encryption/Decryption Algorithm implementing both DES and RSA algorithm.

hybrid-cryptographic-algorithm

Undergraduate Project to develop a Hybrid Cryptographic Algorithm using a combination of ECC, RSA and MD5

hybridcipher

A simple example of DES and RSA in Java that resolve this exercise:

multi-objective-simulated-annealing

Multi Objective Simulated Annealing algorithm sample

multiagent_timetable_scheduling

Implementation of a multi-agent based algorithm for solving a simplified version of the University Timetabling Problem, using Simulated Annealing, in NetLogo

nsga-ii

This is a python implementation of NSGA-II algorithm. NSGA is a popular non-domination based genetic algorithm for multi-objective optimization. It is a very effective algorithm but has been generally criticized for its computational complexity, lack of elitism and for choosing the optimal parameter value for sharing parameter σshare. A modified version, NSGA II was developed, which has a better sorting algorithm , incorporates elitism and no sharing parameter needs to be chosen a priori.

nsga-ii-1

an implementation of NSGA-II in java

nurse-scheduling-problem

This project consists in the implementation for the Nurse Scheduling Problem using Simulated Annealing Metaheuristic.

rsa

Implementation of the RSA algorithm in Python

rsa-calculator

RSA is the algorithm used by modern computers to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm. Asymmetric means that there are two different keys. This is also called public key cryptography, because one of them can be given to everyone. The other key must be kept private. It is based on the fact that finding the factors of an integer is hard (the factoring problem). RSA stands for Ron Rivest, Adi Shamir and Leonard Adleman, who first publicly described it in 1978. A user of RSA creates and then publishes the product of two large prime numbers, along with an auxiliary value, as their public key. The prime factors must be kept secret. Anyone can use the public key to encrypt a message, but with currently published methods, if the public key is large enough, only someone with knowledge of the prime factors can feasibly decode the message

rsa-implementation-in-python

A simple RSA Implementation in Python

simulated-annealing-ai-if3170

Simulated Annealing implementation for scheduling courses

simulatedannealingscheduler

Local Search Scheduling with Simulated Annealing

test-repo