Optimal Sparse Decision Trees
-
Updated
Apr 27, 2023 - Python
Optimal Sparse Decision Trees
This is my undergraduate thesis about high-performance discrete particle swarm optimization (PSO) algorithm and software development of application on JSSP problem.
ALT algorithms on a grid graph used for routing on the sea.
This project presents a C++ implementation for efficiently merging two sorted linked lists into a single sorted list. It focuses on utilizing existing nodes from the original lists and maintaining their order in the merged output.
This Java project focuses on implementing a dynamic programming solution to find the shortest combination of numbers that sum up to a given target sum, using recursion and memoization for efficiency.
A short program written in Java calculates the maximum area that can be contained within a set of vertical lines, utilizing a two-pointer algorithm and handling a variety of test cases from simple to complex.
A Java implementation of an algorithm that determines if a target string can be constructed by concatenating elements from a given word bank, using recursion and memoization for optimization.
Association analysis including support, confidence, and lift between consumer goods
A MATLAB-based implementation of fractal image compression enhanced with the Discrete Cosine Transform (DCT), focusing on optimizing compression ratio, PSNR, and memory usage.
A simulated cache system program. Test cache performance by dynamically specifying the cache structure to see how well optimized an algorithm is on different cache structures.
**push_swap** is a C project that implements a sorting algorithm to sort a stack of integers with the minimum number of operations. The goal is to demonstrate efficient stack manipulation and algorithm optimization.
[FRENCH VERSION] The goal of this school project was to conceptualize an algorithm to define one of the most optimal path (for delivery trucks). I mainly used Python and Jupyter Notebook. During this project, I improved my knowledge of advanced complexity. I evolved in a group of 3, which gave us the opportunity to improve our teamwork skills.
The "Push_swap" project at 42 is a programming challenge focused on sorting integers using a limited set of operations and an auxiliary stack. The goal is to sort the stack with the fewest moves, showcasing efficient algorithm design and problem-solving skills.
DuoHash is an advanced tool for the efficient calculation of forward and reverse hashes of spaced k-mers in nucleotide sequences, improving the analysis of genomic data by reducing processing time and computational resources.
Assignments related to "Algorithm Analysis" course at IPT of NTUU KPI
Add a description, image, and links to the algorithm-optimization topic page so that developers can more easily learn about it.
To associate your repository with the algorithm-optimization topic, visit your repo's landing page and select "manage topics."