Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.148, Iss.1, 1995-08, pp. : 141-156
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
Improved bounds about on-line learning of smooth-functions of a single variable
By Long P.M.
Theoretical Computer Science, Vol. 241, Iss. 1, 2000-06 ,pp. :
Access to resources
Recommend
On the linearity of on-line computable functions
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :
On-line single-server dial-a-ride problems
By Feuerstein
Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. :
Lower bounds for on-line single-machine scheduling
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :