Probability and Plurality for Aggregations of Learning Machines
暂无分享,去创建一个
[1] Daniel N. Osherson,et al. Aggregating Inductive Expertise , 1986, Inf. Control..
[2] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[3] Leonard Pitt,et al. A Characterization of Probabilistic Inference , 1984, FOCS.
[4] Rusins Freivalds,et al. On the Power of Probabilistic Strategies in Inductive Inference , 1984, Theor. Comput. Sci..
[5] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.
[6] Robert P. Daley. On the Error Correcting Power of Pluralism in BC-Type Inductive Inference , 1983, Theoretical Computer Science.
[7] John Case,et al. Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..
[8] Carl H. Smith,et al. The Power of Pluralism for Automatic Program Synthesis , 1982, JACM.
[9] Paul Young,et al. An introduction to the general theory of algorithms , 1978 .
[10] Karlis Podnieks. Probabilistic program synthesis , 1977 .
[11] Manuel Blum,et al. Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..
[12] R. V. Freivald. Functions Computable in the Limit by Probabilistic Machines , 1974, MFCS.
[13] Jerome A. Feldman,et al. Some Decidability Results on Grammatical Inference and Complexity , 1972, Inf. Control..
[14] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..