Using Available Memory to Transform Graphplan's Search
暂无分享,去创建一个
[1] Terry L. Zimmerman,et al. Using Memory to Transform Search on the Planning Graph , 2005, J. Artif. Intell. Res..
[2] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[3] Philippe Flajolet,et al. Approximate counting: A detailed analysis , 1985, BIT.
[4] Treebank Penn,et al. Linguistic Data Consortium , 1999 .
[5] Robert H. Morris,et al. Counting large numbers of events in small registers , 1978, CACM.
[6] Subbarao Kambhampati,et al. Extracting Effective and Admissible State Space Heuristics from the Planning Graph , 2000, AAAI/IAAI.
[7] Melanie Remy,et al. Wikipedia: The Free Encyclopedia200214Wikipedia: The Free Encyclopedia. 2001 – updated daily. Gratis http://www.wikipedia.com , 2002 .
[8] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[9] Yossi Matias,et al. Spectral bloom filters , 2003, SIGMOD '03.
[10] Subbarao Kambhampati,et al. Exploiting Symmetry in the Planning graph via Explanation-Guided Search , 1999, AAAI/IAAI.
[11] Hermann Ney,et al. On structuring probabilistic dependences in stochastic language modelling , 1994, Comput. Speech Lang..
[12] Blai Bonet,et al. Planning as Heuristic Search: New Results , 1999, ECP.
[13] R. Lathe. Phd by thesis , 1988, Nature.