Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

First Page		Document Content
Date: 2016-05-24 11:28:44 Graph theory Mathematics Computational complexity theory Operations research Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Travelling salesman problem A* search algorithm Flow network Tree traversal		Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n Add to Reading List Source URL: emarkou.users.uth.gr Download Document from Source Website File Size: 333,41 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