Critical Constrained Planning and an Application to Network Penetration Testing Marcel Steinmetz Saarland University Saarbr¨ucken, Germany {steinmetz - Penetration - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-06-09 08:09:42 Search algorithms Theoretical computer science Heuristic State space search Mathematical optimization Algorithm Mathematics Philosophy of mathematics Cognitive science		Critical Constrained Planning and an Application to Network Penetration Testing Marcel Steinmetz Saarland University Saarbr¨ucken, Germany {steinmetz}@cs.uni-saarland.de Add to Reading List Source URL: icaps16.icaps-conference.org Download Document from Source Website File Size: 106,82 KB Share Document on Facebook

	Exploiting Search Space Structure in Classical Planning: Analyses and Algorithms (Dissertation Abstract) Masataro Asai Graduate School of Arts and Sciences University of Tokyo DocID: 1xUEX - View Document
	Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo DocID: 1xTM6 - View Document
	Chapter 3 Classical Optimization and Search Techniques In this chapter we discuss a few popular optimization techniques in use in current day natural language processing algorithms. First we present the Hidden Markov DocID: 1uSjw - View Document
	Line Search for Averaged Operator Iteration Pontus Giselsson, Mattias F¨alt, and Stephen Boyd Abstract Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford sp DocID: 1uOGW - View Document
	Structuring Depth-First Search Algorithms in Haskell David J. King John Launchbury Department of Computing Science DocID: 1uNEx - View Document