clamesc/reinforcement-learning-mindmap

Stars
3
Rank 3,963,521 (Top 79 %)
Language
License
GNU General Publi...
Created almost 7 years ago
Updated almost 7 years ago

clamesc/reinforcement-learning-mindmap

clamesc

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Freeplane mindmap based on the "Reinforcement Learning" lecture by David Silver.

Training-Neural-Networks-for-Event-Based-End-to-End-Robot-Control

TUM Master’s thesis: Steering a robot with an event-based vision sensor in a lane-keeping task using methods such as Deep Reinforcement Learning or Spiking Neural Networks.

Decentralized-Scheduling-Strategy-of-Heating-Systems

RWTH Bachelor’s thesis: Optimization algorithm that balances the residual load in microgrids with heat pumps and combined heat / power units, while maintaining data privacy and economical fairness.

Machine-Learning-in-Medical-Imaging--U-Net

TUM_MLMI_SS16: Convolutional Neural Network using U-Net architecture to predict one modality of a brain MRI scan from another modality.

cpp-mindmap

Freeplane mindmap based on learncpp.com C++ tutorial.

ePuck-Box-Pushing

TUM_ARL_SS16: With its proximity sensors the ePuck robot can estimate the relative position of a small box and learn to push it in a given direction using Reinforcement Learning.

Machine-Learning-in-Medical-Imaging--Exercises

TUM_MLMI_SS16: Assignments in different Machine Learning topics .

Jupyter Notebook

machine-learning-mindmap

Freeplane mindmap based on the TUM course "Machine Learning [IN2064]" during WS15/16.

artificial-intelligence-mindmap

Freeplane mindmap based on TUM course "Techniques in Artificial Intelligence [IN2062]" during WS15/16.

deep-learning-mindmap

Freeplane mindmap based on book "Deep Learning" by Ian Goodfellow, Yoshua Bengio and Aaron Courville.

Propositional-Logic-Parser

TUM_AI_WS1516: The parser module reads ASCII strings and converts them into propositional logic formula. The entailment module reads two parsed propositional logic formulae A and B, and then it decides whether A != B or not.