On the Complexity of Finding Spanner Paths

First Page		Document Content
Date: 2013-06-03 08:35:50 Network theory Combinatorial optimization Routing algorithms Search algorithms Shortest path problem Induced path A* search algorithm Path decomposition Widest path problem Graph theory Mathematics Theoretical computer science		On the Complexity of Finding Spanner Paths Add to Reading List Source URL: www.ida.liu.se Download Document from Source Website File Size: 273,62 KB 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