Q-leaming vs. FRIQ-leaming in the Maze problem

Tamas Tompa, Szilveszter Kovacs. Q-leaming vs. FRIQ-leaming in the Maze problem. In 6th IEEE International Conference on Cognitive Infocommunications, CogInfoCom 2015, Gyor, Hungary, October 19-21, 2015. pages 545-550, IEEE, 2015. [doi]

Authors

Tamas Tompa

This author has not been identified. Look up 'Tamas Tompa' in Google

Szilveszter Kovacs

This author has not been identified. Look up 'Szilveszter Kovacs' in Google