Instance-Based Policy Search using Binomial Distribution Crossover and Iterated Refreshment
暂无分享,去创建一个
[1] M. Yamamura,et al. A functional specialization hypothesis for designing genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).
[2] Ashwin Ram,et al. Experiments with Reinforcement Learning in Problems with Continuous State and Action Spaces , 1997, Adapt. Behav..
[3] Riva RoadAnnapolis. Memory Based Learning of Pursuit Games , 1995 .
[4] Steven Salzberg,et al. A Teaching Strategy for Memory-Based Control , 1997, Artificial Intelligence Review.
[5] Steven Salzberg,et al. Combining Genetic Algorithms with Memory Based Reasoning , 1995, ICGA.
[6] I. Ono,et al. A Genetic Algorithm Taking Account of Characteristics Preservation for Job Shop Scheduling Problems , 1998 .
[7] Andrew W. Moore,et al. Locally Weighted Learning for Control , 1997, Artificial Intelligence Review.
[8] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[9] David W. Aha,et al. Learning to Catch: Applying Nearest Neighbor Algorithms to Dynamic Control Tasks , 1994 .
[10] Kokolo Ikeda. Exemplar-based direct policy search with evolutionary optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.