Learning Disjunction of Conjunctions
暂无分享,去创建一个
[1] Allen Newell,et al. Human Problem Solving. , 1973 .
[2] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[3] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[4] W. Reichardt,et al. Visual control of flight in flies , 1981 .
[5] Robert A. Kowalski,et al. Logic for problem solving , 1982, The computer science library : Artificial intelligence series.
[6] Herbert A. Simon,et al. WHY SHOULD MACHINES LEARN , 1983 .
[7] Thomas G. Dietterich,et al. A Comparative Review of Selected Methods for Learning from Examples , 1983 .
[8] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.
[9] Hector J. Levesque,et al. The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.
[10] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[11] Geoffrey E. Hinton,et al. A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..