Planning with Concurrent Execution Bence Cserna Department of Computer Science University of New Hampshire Durham, NHUSA

First Page		Document Content
Date: 2016-06-09 08:09:24 Search algorithms Game artificial intelligence Combinatorial optimization Mathematics Information science Information retrieval Artificial intelligence Routing algorithms Automated planning and scheduling A* search algorithm Heuristic Incremental heuristic search		Planning with Concurrent Execution Bence Cserna Department of Computer Science University of New Hampshire Durham, NHUSA Add to Reading List Source URL: icaps16.icaps-conference.org Download Document from Source Website File Size: 76,58 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