exhaustive-search

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

Exhaustive chess game-tree explorer — transposition tables, Zobrist hashing, destiny overlays. Godot 4.3 + Rust implementations.

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

Exhausting way to solve the "number guessing" game.

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

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.

Extremal lattice rigidity from the No-Three-In-Line problem: symmetry, fundamental domains, and Sidon structures.

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

A simple implementation of the 3SAT problem

Exact verification of the Gold Partition Conjecture for every non-chain poset on at most 14 elements, with reproducible C code and archived data.

Explanation of MDP project