Author： Hojati Mehran
Publisher： Springer Publishing Company
ISSN： 0254-5330
Source： Annals of Operations Research, Vol.181, Iss.1, 2010-12, pp. : 539-557
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Near-Optimal Reinforcement Learning in Polynomial Time
By Kearns M.
Machine Learning, Vol. 49, Iss. 2-3, 2002-11 ,pp. :
Optimal and Near-Optimal Algorithms for
By Santos E.E.
Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. :
A time-optimal solution for the path cover problem on cographs
By Nakano K. Olariu S. Zomaya A.Y.
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :