This is a repository for my Diploma Thesis on Wireless Communications at Aristotle University of Thessaloniki
Feature selection package of the mlr3 ecosystem.
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
Laboratorio de la asignatura Estructuras de Datos y Algoritmos (C++)
Finding Relationships in Data: UBC Term Project 2024W2 - Predictive Modelling
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.
Zig port of exhaustigen library for exhaustive testing.
Two algorithms are implemented: the exhaustive algorithm and nearest neighbor algorithm
An assignment implemented for the university.
Enumerate all strings that match a given regex
A tiny library to help in exhaustive testing of Boolean functions in Python.
A website for solving combinatorics problems
MATLAB code implementations for Nonlinear Programming problems, covering methods like KKT conditions, optimization algorithms, genetic algorithms and penalty function approaches.
Add a description, image, and links to the exhaustive-search topic page so that developers can more easily learn about it.
To associate your repository with the exhaustive-search topic, visit your repo's landing page and select "manage topics."