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

AES CUDA

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

Enumerate all strings that match a given regex

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.

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

Exhausting way to solve the "number guessing" game.

A simple implementation of the 3SAT problem

Explanation of MDP project

A script to find the best city layout in Spore game

Simple code written in Java to solve the game solitaire.

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

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

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