Author： Vorobeychik Yevgeniy
Publisher： Springer Publishing Company
ISSN： 0885-6125
Source： Machine Learning, Vol.67, Iss.1-2, 2007-05, pp. : 145-168
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
The complexity of mean payoff games on graphs
Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. :
Access to resources
Recommend
Learning Boolean Functions in an Infinite Attribute Space
By Blum A.
Machine Learning, Vol. 09, Iss. 4, 1992-10 ,pp. :
Infinite cyclic impartial games
By Fraenkel
Theoretical Computer Science, Vol. 252, Iss. 1, 2001-02 ,pp. :
Memoryless determinacy of parity and mean payoff games: a simple proof
By Bjorklund H. Sandberg S. Vorobyov S.
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :