VIP cheatsheets for Stanford's CS 221 Artificial Intelligence
-
Updated
Dec 17, 2019
VIP cheatsheets for Stanford's CS 221 Artificial Intelligence
Master Reinforcement and Deep Reinforcement Learning using OpenAI Gym and TensorFlow
MDPs and POMDPs in Julia - An interface for defining, solving, and simulating fully and partially observable Markov decision processes on discrete and continuous spaces.
A C++ framework for MDPs and POMDPs with Python bindings
Curso de Álgebra Lineal
Extensible Combinatorial Optimization Learning Environments
Stochastic Dual Dynamic Programming in Julia
A framework to build and solve POMDP problems. Documentation: https://h2r.github.io/pomdp-py/
Coding Demos from the School of AI's Move37 Course
An Automata Learning Library Written in Python
A research platform to develop automated security policies using quantitative methods, e.g., optimal control, computational game theory, reinforcement learning, optimization, evolutionary methods, and causal inference.
🌀 Stanford CS 228 - Probabilistic Graphical Models
Implementation of value iteration algorithm for calculating an optimal MDP policy
WrightEagle Base Code for RoboCup Soccer Simulation 2D
Framework for the simulation and estimation of some finite-horizon discrete choice dynamic programming models.
Reinforcement Learning in JavaScript
🐍 AI that learns to play Snake using Q-Learning (Reinforcement Learning)
Online algorithms for solving large-scale dynamic vehicle routing problems with stochastic requests
A QoE-Oriented Computation Offloading Algorithm based on Deep Reinforcement Learning for Mobile Edge Computing
Implementation of Tsallis Actor Critic method
Add a description, image, and links to the markov-decision-processes topic page so that developers can more easily learn about it.
To associate your repository with the markov-decision-processes topic, visit your repo's landing page and select "manage topics."