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]

@inproceedings{TompaK15,
  title = {Q-leaming vs. FRIQ-leaming in the Maze problem},
  author = {Tamas Tompa and Szilveszter Kovacs},
  year = {2015},
  doi = {10.1109/CogInfoCom.2015.7390652},
  url = {https://doi.org/10.1109/CogInfoCom.2015.7390652},
  researchr = {https://researchr.org/publication/TompaK15},
  cites = {0},
  citedby = {0},
  pages = {545-550},
  booktitle = {6th IEEE International Conference on Cognitive Infocommunications, CogInfoCom 2015, Gyor, Hungary, October 19-21, 2015},
  publisher = {IEEE},
  isbn = {978-1-4673-8129-1},
}