optimisation

Dynamic view distance based on MSPT. Paper and above.

University Coursework @ UCL for compilers ( COMP0012 / COMP0207 ) module for backend code optimization of code using BCEL

This project is about using artificial intelligence and parallel processing power to solve a difficult task scheduling problem

LagAssist source code, but with gradle.

A tool designed for the simulation of mobile network technologies, specifically 3G and 4G, facilitating the planning, sizing, and optimization of network resources

A Client-Side fabric mod for making Minehut bearable.

Java Swing GUI for visualizing Ant Colony Optimization on the Traveling Salesman Problem, with random and NYC datasets, adjustable ACO parameters, live tours, and a GitHub Pages demo.

Implémentation JAVA Gradient à pas fixe

Using the Roundabout-Simulation-Library, the model of the roundabout Dornbirn North will be implemented and provided to run optimisations afterwards.

Fork of metallum to optimise the shit out of it to improve Mac optimisation for Minecraft by targeting MacOS Graphics API (MetalFX)

Cleans up the server and optimizes memory and cpu usage.

Solution aux exercices Mars Lander 2 & 3 proposés par la plateforme Codingame.

Solves the discrete, single-machine, multi-item, single-level lot sizing problem via graph algorithms

Multi-Objective Continuous Optimisation Problems

The simulated annealing algorithm started with a random route and got a random number for the route. When the number is smaller and equal to the probability function, it will proceed to the adjacent route. If the adjoining route is larger than the current route, it will still proceed to the next route until it gets the shortest adjacent route. I…

Eclipse-based tool for optimal configuration of software product lines

The nearest neighbor algorithm gets the shortest route from the initial course whenever generating the result. It will always check for the journey to reduce one city from the way, which is the shortest route, and then it will run again for the remaining cities until it gets the best result. It follows the pattern until there are no remaining ci…

This project is for the courseworks of Cambridge Engineering Module 4M17 - practical optimisation.

In the brute force algorithm, the program will go through all the permutations of starting a trip from one of the cities, visiting each city once, and returning to the first cities. It shows all the possible shortest routes with the same distance out of all the permutations. The downside of this algorithm is that increasing the number of cities …

Analysis of market data in context of optimising SBE-Aeron stack