Results of the First Strathclyde Planning Competition Compiled by Andrew Coles and Amanda Smith Department of Computer and Information Sciences. University of Strathclyde. 26 Richmond Street, Glasgow, G1 1XH, UK firstnam

First Page		Document Content
Date: 2011-11-03 17:18:55 Applied mathematics Hill climbing Best-first search Heuristic function A* search algorithm Algorithm Heuristic Search algorithms Artificial intelligence Mathematics		Results of the First Strathclyde Planning Competition Compiled by Andrew Coles and Amanda Smith Department of Computer and Information Sciences. University of Strathclyde. 26 Richmond Street, Glasgow, G1 1XH, UK firstnam Add to Reading List Source URL: www.inf.kcl.ac.uk Download Document from Source Website File Size: 181,42 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