ImageJ plugin for the fast generation of microscopy PSF

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover

Flappy Bird for artificial intelligence/machine learning (Agent available: Q-Learning, SARSA, and combined with Backpropagation)

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

Application for monitoring urban traffic.

Icy plugin for the fast generation of microscopy PSF

Calculator that approximates integrals

Simple example of counting approximation by least squares using JavaFX

App for Approximation of Dynamic Objects by Fractional Order Transfer Function

Java project that calculates digits of Pi.

This program will approximate the Traveling salesman problem using 3 three different algorithms (Nearest Neighbot, 2Opt, and 3Opt). There are 6 different combinations and each can be run individually or in suite as part of a benchmark test.

Travelling salesman problem in JavaFX