21 results found Sort:

VIP cheatsheets for Stanford's CS 221 Artificial Intelligence
Created 2019-05-24
41 commits to master branch, last one 5 years ago
104
686
other
43
MDPs and POMDPs in Julia - An interface for defining, solving, and simulating fully and partially observable Markov decision processes on discrete and continuous spaces.
Created 2015-06-23
887 commits to master branch, last one 4 months ago
99
655
gpl-3.0
34
A C++ framework for MDPs and POMDPs with Python bindings
Created 2013-11-16
1,750 commits to master branch, last one about a year ago
1.1k
482
unknown
204
Curso de Álgebra Lineal
Created 2018-12-03
113 commits to master branch, last one 2 years ago
69
334
bsd-3-clause
7
Extensible Combinatorial Optimization Learning Environments
Created 2019-10-18
1,510 commits to master branch, last one 2 years ago
52
235
mit
11
A framework to build and solve POMDP problems. Documentation: https://h2r.github.io/pomdp-py/
Created 2019-09-22
369 commits to main branch, last one 10 months ago
27
130
mit
9
A QoE-Oriented Computation Offloading Algorithm based on Deep Reinforcement Learning (DRL) for Mobile Edge Computing (MEC) | This algorithm captures the dynamics of the MEC environment by integrating ...
Created 2023-07-31
191 commits to main branch, last one about a month ago
20
125
other
8
A research platform to develop automated security policies using quantitative methods, e.g., optimal control, computational game theory, reinforcement learning, optimization, evolutionary methods, and...
Created 2020-09-07
3,963 commits to master branch, last one 3 days ago
🌲 Stanford CS 228 - Probabilistic Graphical Models
Created 2018-12-26
50 commits to master branch, last one 5 months ago
WrightEagle Base Code for RoboCup Soccer Simulation 2D
Created 2015-09-09
103 commits to master branch, last one 2 years ago
Online algorithms for solving large-scale dynamic vehicle routing problems with stochastic requests
Created 2022-02-07
89 commits to main branch, last one 2 years ago
Framework for the simulation and estimation of some finite-horizon discrete choice dynamic programming models.
Created 2016-04-25
3,177 commits to main branch, last one about a year ago
Monte Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space and building a search tree accordingly. It has already had a p...
Created 2019-10-10
29 commits to master branch, last one 11 months ago
Implementation of Tsallis Actor Critic method
Created 2018-11-21
346 commits to master branch, last one 3 months ago
AWS Last Mile Route Sequence Optimization
Created 2022-04-26
44 commits to main branch, last one 8 months ago
25
55
unlicense
5
My solutions to Yandex Practical Reinforcement Learning course in PyTorch and Tensorflow
Created 2018-05-10
710 commits to master branch, last one 6 years ago
High Performance Map Matching with Markov Decision Processes (MDPs) and Hidden Markov Models (HMMs).
Created 2021-10-12
125 commits to main branch, last one 2 months ago