暂无分享,去创建一个
[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[2] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[3] Ugo Montanari,et al. On the optimal detection of curves in noisy pictures , 1971, CACM.
[4] Donald E. Knuth,et al. A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..
[5] Larry S. Davis,et al. Pattern Databases , 1979, Data Base Design Techniques II.
[6] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[8] Shimon Ullman,et al. Structural Saliency: The Detection Of Globally Salient Structures using A Locally Connected Network , 1988, [1988 Proceedings] Second International Conference on Computer Vision.
[9] Lawrence R. Rabiner,et al. A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.
[10] Eugene Charniak,et al. Statistical language learning , 1997 .
[11] Ronen Basri,et al. Extracting Salient Curves from Images: An Analysis of the Saliency Network , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[12] Weixiong Zhang,et al. A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem , 1996, Artif. Intell..
[13] Robert C. Holte,et al. Hierarchical A*: Searching Abstraction Hierarchies Efficiently , 1996, AAAI/IAAI, Vol. 1.
[14] Lance R. Williams,et al. Local Parallel Computation of Stochastic Completion Fields , 1997, Neural Computation.
[15] Richard E. Korf,et al. Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.
[16] David A. McAllester. On the complexity analysis of static analyses , 1999, JACM.
[17] Carme Torras,et al. An efficient algorithm for searching implicit AND/OR graphs with cycles , 2000, Artificial Intelligence.
[18] Shlomo Zilberstein,et al. LAO*: A heuristic search algorithm that finds solutions with loops , 2001, Artif. Intell..
[19] Christopher Raphael,et al. Coarse-to-Fine Dynamic Programming , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[20] Stefan Edelkamp,et al. Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.
[21] Hinrich Schütze,et al. Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.
[22] Richard E. Korf,et al. Disjoint pattern database heuristics , 2002, Artif. Intell..
[23] Dan Klein,et al. A* Parsing: Fast Exact Viterbi Parse Selection , 2003, NAACL.
[24] Ronen Basri,et al. Extracting Salient Curves from Images: An Analysis of the Saliency Network , 2004, International Journal of Computer Vision.
[25] Stefan Edelkamp,et al. External Symbolic Heuristic Search with Pattern Databases , 2005, ICAPS.
[26] Zhuowen Tu,et al. Image Parsing: Unifying Segmentation, Detection, and Recognition , 2005, International Journal of Computer Vision.
[27] Blai Bonet,et al. An Algorithm Better than AO*? , 2005, AAAI.
[28] Ariel Felner,et al. Finding optimal solutions to the graph partitioning problem with heuristic search , 2005, Annals of Mathematics and Artificial Intelligence.
[29] Brian Tanner,et al. Hierarchical Heuristic Search Revisited , 2005, SARA.
[30] Stuart Geman,et al. Context and Hierarchy in a Probabilistic Image Model , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[31] Vadim Bulitko. State Abstraction in Real-Time Heuristic Search , 2007, SARA.
[32] Nathan R. Sturtevant,et al. Graph Abstraction in Real-time Heuristic Search , 2007, J. Artif. Intell. Res..
[33] J. Schmidhuber,et al. Frontier Search , 2009 .