Author:
Asiain Erick,Clempner Julio B.,Poznyak Alexander S.
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference24 articles.
1. Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773–4795
2. Abualigah LM, Khader AT, Hanandeh ES, Gandomi AH (2017) A novel hybridization strategy for krill herd algorithm applied to clustering techniques. Appl Soft Comput 60:423–435
3. Auer P, Ortner R (2007) Logarithmic online regret bounds for undiscounted reinforcement learning. In: Advances in neural information processing systems, vol 19 (NIPS 2006), MIT Press, pp 49–56
4. Brafman RI, Tennenholtz M (2000) A near-optimal polynomial time algorithm for learning in certain classes of stochastic games. Artif Intell 121(1–2):31–47
5. Brafman RI, Tennenholtz M (2002) R-max—a general polynomial time algorithm for nearoptimal reinforcement learning. J Mach Lean Res 3:213–231
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献