Algorithms for the Black and White Knapsack Problem.
-
Updated
Jul 15, 2016 - C
Algorithms for the Black and White Knapsack Problem.
Parameter Optimization in PEM Fuel Cells: A Genetic Algorithm Approach Versus A Point-Based Heuristic Comparison
Chess game and AI written in Scala
This repo is where I'll be doing most of my AI homework. Working together with python and various learning algorithms
Using CSP heuristics
University work. Research-grade code using genetic algorithms for a variant of the parking space optmization problem.
A collection of various pacman solving agents and their comparison.
Simple genetic algorithm for TSP
Code for the paper on neural title generation. It uses encoder based LSTM architectures and some heuristics to predict catchy titles for scientific papers
Simple parameter tuner for heuristics
A machine learning approach of playing the board game Saboteur using Reinforcement Learning
A program containing different heuristics for the knapsack problem
Solução do problema n-puzzle (busca com A* e três tipos de heurísticas)
Multi touch attribution models, including Markov chains
User-centered Design course project
Solving NP-Hard Problems
AI player implemented for the 2048 single-player game using expectimax algorithm with heuristics
Solves wordle using simple heuristics
This respository constains heuristics, also metaheuristics
Add a description, image, and links to the heuristics topic page so that developers can more easily learn about it.
To associate your repository with the heuristics topic, visit your repo's landing page and select "manage topics."