摘要: Penetration Testing is a methodology for assessing network security, by generating and executing possible attacks. Doing so automatically allows for regular and systematic testing …
harvard.edu
arxiv.org参考文章(57)
Robert Stone, Dug Song, Rob Malan, A Snapshot of Global Internet Worm Activity ,(2001)
Hector Geffner, The model-based approach to autonomous behavior: a personal view national conference on artificial intelligence. pp. 1709- 1712 ,(2010)
Blai Bonet, Héctor Geffner, Solving POMDPs: RTDP-bel vs. point-based algorithms international joint conference on artificial intelligence. pp. 1641- 1646 ,(2009)
George E. Monahan, George E. MONAHANt, A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms ,(2007)
Anthony Rocco Cassandra, Leslie Pack Kaelbling, Exact and approximate algorithms for partially observable markov decision processes Brown University. ,(1998)
Jorg Hoffmann, Extending FF to numerical state variables european conference on artificial intelligence. pp. 571- 575 ,(2002)
Malik Ghallab, Dana S. Nau, Paolo Traverso, Automated Planning, Theory And Practice ,(2006)
John D. Howard, Thomas A Longstaff, A common language for computer security incidents United States. National Technical Information Service. ,(1998) , 10.2172/751004
Nir Friedman, Daniel L. Koller, Probabilistic graphical models : principles and techniques The MIT Press. ,(2009)
Niels Provos, A virtual honeypot framework usenix security symposium. pp. 1- 1 ,(2004)