Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

First Page		Document Content
Date: 2015-05-29 10:12:12 Mathematics Graph theory Routing algorithms Discrete mathematics Edsger W. Dijkstra Network theory Combinatorial optimization Search algorithms Distance oracle A* search algorithm Shortest path problem Link-state routing protocol		Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] † Add to Reading List Source URL: people.mpi-inf.mpg.de Download Document from Source Website File Size: 499,82 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