A new algorithm of quantitative analyzing complex incident response plan
暂无分享,去创建一个
Liu Ping | Li Jin | Yu Haifeng | Xu Boyi
[1] Dana S. Nau,et al. SHOP2: An HTN Planning System , 2003, J. Artif. Intell. Res..
[2] Ulrich Meyer,et al. Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm , 2009, ALENEX.
[3] Paul H. J. Kelly,et al. A dynamic topological sort algorithm for directed acyclic graphs , 2007, ACM J. Exp. Algorithmics.
[4] Ivan Serina,et al. Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search , 2010, ICAPS.
[5] Stefan Edelkamp,et al. Automated Planning: Theory and Practice , 2007, Künstliche Intell..
[6] George Kurtz,et al. Hacking Exposed , 2005 .
[7] George Kurtz,et al. Hacking Exposed: Network Security Secrets & Solutions , 1999 .
[8] Marc Schoenauer,et al. An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning , 2010, ICAPS.
[9] Roberto Bruni,et al. An Algebra of Hierarchical Graphs and its Application to Structural Encoding , 2010, Sci. Ann. Comput. Sci..