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.
Laboratorio de la asignatura Estructuras de Datos y Algoritmos (C++)
Enumerate all strings that match a given regex
My solutions to some of Matt Parker's Maths Puzzles.
UQAC 8INF870 Algorithmic school project - Set Cover Problem (SCP)
Exhausting way to solve the "number guessing" game.
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.
A simple implementation of the 3SAT problem
A website for solving combinatorics problems
A tiny library to help in exhaustive testing of Boolean functions in Python.
Java implementation of exhaustive and heuristic search algorithms for robotic positioning in engine assembly.
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."