Lecture XIII §1. Union Find Problem Page 1

First Page		Document Content
Date: 2013-11-21 18:52:43 Heuristic Graph theory Binary trees Search algorithms Mathematics Artificial intelligence A* search algorithm Splay tree Data structures Disjoint-set data structure Heuristic function		Lecture XIII §1. Union Find Problem Page 1 Add to Reading List Source URL: cs.nyu.edu Download Document from Source Website File Size: 337,61 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