Author: Fisher Michael
Publisher: Springer Publishing Company
ISSN: 1387-2532
Source: Autonomous Agents and Multi-Agent Systems, Vol.21, Iss.3, 2010-11, pp. : 368-396
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
On resource-bounded instance complexity
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
Resource-bounded Relational Reasoning:Induction and Deduction Through Stochastic Matching
By Sebag M.
Machine Learning, Vol. 38, Iss. 1-2, 2000-01 ,pp. :
A stronger Kolmogorov zero-one law for resource-bounded measure
By Dai J.J.
Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. :
Resource bounded randomness and computational complexity
By Wang Y.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :