Towards Practical Universal Search
暂无分享,去创建一个
[1] Chu Min Li,et al. Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.
[2] Tom Schaul. Evolving a compact, concept-based Sokoban solver , 2006 .
[3] Leslie G. Valiant,et al. Cognitive computation , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[4] Jürgen Schmidhuber,et al. Solving POMDPs with Levin Search and EIRA , 1996, ICML.
[5] Jürgen Schmidhuber. Discovering Solutions with Low Kolmogorov Complexity and High Generalization Capability , 1995, ICML.
[6] Jürgen Schmidhuber,et al. Ultimate Cognition à la Gödel , 2009, Cognitive Computation.
[7] Jürgen Schmidhuber,et al. Searching for Minimal Neural Networks in Fourier Space , 2010, AGI 2010.
[8] Bart Selman,et al. Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.
[9] Jürgen Schmidhuber,et al. Learning dynamic algorithm portfolios , 2006, Annals of Mathematics and Artificial Intelligence.
[10] Jürgen Schmidhuber,et al. Optimal Ordered Problem Solver , 2002, Machine Learning.
[11] Marcus Hutter. The Fastest and Shortest Algorithm for all Well-Defined Problems , 2002, Int. J. Found. Comput. Sci..