A Sampling-Based Heuristic for Tree Search Applied to Grammar Induction
暂无分享,去创建一个
[1] Barak A. Pearlmutter,et al. Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm , 1998, ICGI.
[2] A. A. Zhigli︠a︡vskiĭ,et al. Theory of Global Random Search , 1991 .
[3] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[4] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.
[5] Thomas Bäck,et al. A Survey of Evolution Strategies , 1991, ICGA.
[6] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[7] E. Mark Gold,et al. Complexity of Automaton Identification from Given Data , 1978, Inf. Control..
[8] Pang C. Chen. Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs , 1992, SIAM J. Comput..
[9] Boris A. Trakhtenbrot,et al. Finite automata : behavior and synthesis , 1973 .
[10] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[11] Eric B. Baum,et al. On Optimal Game Tree Propagation for Imperfect Players , 1992, AAAI.
[12] Barak A. Pearlmutter,et al. Ab-badingo one: Dfa learning competition , 1997 .
[13] Kevin J. Lang. Random DFA's can be approximately learned from sparse uniform examples , 1992, COLT '92.
[14] W. Daniel Hillis,et al. Co-evolving parasites improve simulated evolution as an optimization procedure , 1990 .