An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C
-
Updated
May 29, 2024 - C
An implementation of an A* Informed Search Algorithm for solving the N-Puzzle problem, using several heuristic functions, written in C
Записките ми за упражнения по "Дизайн и анализ на алгоритми"
Karp's 21st problem, called the Maximum Cut Problem, implemented into Java
Algorithm Analysis and Development
Strip Packing Written in C++
Notes of Algorithms Learning
Foundations of Computer Science
This repo contains the implementation of an heuristic to solve the Traveling Tournament Problem (TTP), as well as the implementation of the Meta-heuristics' algorithm Iterated Local Search (ILS) satisfying the predefined contraints of the NP-hard problem.
Course projects on various NP and NPH problems on CTU in Prague 2021. Knapsack problem with various approaches, analysis of effectivity and robustness. Instances generation and validation. Approximation algorithms (FPTAS) and advanced iterative methods (genetic algorithm, simulated annealing).
This repository contains all the solutions of assignments, starter files and other materials related to this specialization.
Homeworks done in course CS 599: Algorithms - Design, Analysis, and Implementations at Oregon State University
🧙🏾♂️ Complex Algorithms and Complexity Course from the University of San Diego
What I learned from Data Structures and Algorithms Specialization on Coursera.
Coursera Data Structures and Algorithms Specialization course 5 --> Advanced Algorithms and Complexity... Code is completed in python only.
The aim of the course is to provide a solid knowledge on how to design and analyse the most important classes of algorithms.
Algorithms-Specialization from Stanford:
Non-Deterministic Objects library (CombView API)
Presents a reduction from 3DM to Nonogram
Add a description, image, and links to the np-completeness topic page so that developers can more easily learn about it.
To associate your repository with the np-completeness topic, visit your repo's landing page and select "manage topics."