Feature selection package of the mlr3 ecosystem.

This is a repository for my Diploma Thesis on Wireless Communications at Aristotle University of Thessaloniki

Digital Video Processing Graduate Course Homeworks

This project is coding for fun. It will be using heuristic and metaheuristic algorithm to optimize problems. All code will be conducted by c++.

mirror of Open Molecule Generator from https://git.code.sf.net/p/openmg/code

ExhaustiveSearch: A Fast and Scalable Exhaustive Feature Selection Framework

A blackbox statistical optimization approach to find genetic signatures in scRNA-seq data

A collection of optimization methods in engineering applications (OMEA), implemented in Python — including linear, nonlinear and constrained, with examples.

AES CUDA

Enumerate all strings that match a given regex

UQAC 8INF870 Algorithmic school project - Set Cover Problem (SCP)

My solutions to some of Matt Parker's Maths Puzzles.

Parallel and sequential algorithms for finding philogenetic trees using Maximum Parsimony. The scoring algorithm used is Fitch scoring algorithm. Exhaustive search and Branch and Bound search algorithms are implemented in sequential variant. SPMD method is used in parallel implementation.

Exhausting way to solve the "number guessing" game.

Laboratorio de la asignatura Estructuras de Datos y Algoritmos (C++)

A simple implementation of the 3SAT problem

A script to find the best city layout in Spore game

Java implementation of exhaustive and heuristic search algorithms for robotic positioning in engine assembly.

A greedy, exhaustive search and heuristic solution for a fabric cutting space optimization problem

Introduction to Algorithm Design (PYTHON Language) Algorithms, Complexity Analysis, Decrease and Conquer, Exhaustive Search, Divide and Conquer, Dynamic Programming, Greedy Algorithm

MATLAB code implementations for Nonlinear Programming problems, covering methods like KKT conditions, optimization algorithms, genetic algorithms and penalty function approaches.

Simple code written in Java to solve the game solitaire.

A website for solving combinatorics problems

Assignments Completed during CSE653:Topics in Cryptanalysis Course in IIITD during Winter 2025 Semester. Professor: Ravi Anand

A tiny library to help in exhaustive testing of Boolean functions in Python.

Explanation of MDP project

Library to enumerate all natural number lists with a target sum.

Two algorithms are implemented: the exhaustive algorithm and nearest neighbor algorithm

Finding Relationships in Data: UBC Term Project 2024W2 - Predictive Modelling

Approaching the assembly line problem from an exhaustive, greedy and metaheuristic POV 🎛