Block A*: Database-Driven Search with Applications in Any-angle Path-Planning Peter Yap and Neil Burch and Rob Holte and Jonathan Schaeffer Computing Science Department

First Page		Document Content
Date: 2011-05-17 10:41:28 Artificial intelligence Routing algorithms Graph theory Combinatorial optimization Any-angle path planning A* search algorithm Pathfinding Heuristic function Shortest path problem Search algorithms Mathematics Game artificial intelligence		Block A*: Database-Driven Search with Applications in Any-angle Path-Planning Peter Yap and Neil Burch and Rob Holte and Jonathan Schaeffer Computing Science Department Add to Reading List Source URL: webdocs.cs.ualberta.ca Download Document from Source Website File Size: 1,17 MB Share Document on Facebook

	Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm DocID: 1vdZY - View Document
	Automatic Power System Restoration Application of a Search Algorithm Lars Lindgren DocID: 1up2e - View Document
	A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud DocID: 1ueLR - View Document
	A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud DocID: 1tFfm - View Document
	________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau DocID: 1tqh4 - View Document