Softstar: Heuristic-Guided Probabilistic Inference Mathew Monfort Computer Science Department University of Illinois at Chicago Chicago, IL 60607

First Page		Document Content
Date: 2015-11-01 13:02:43 Search algorithms Routing algorithms Combinatorial optimization Mathematics Information science Information retrieval Game artificial intelligence A* search algorithm Heuristic Bayesian network Dijkstra's algorithm Algorithm		Softstar: Heuristic-Guided Probabilistic Inference Mathew Monfort Computer Science Department University of Illinois at Chicago Chicago, IL 60607 Add to Reading List Source URL: cims.nyu.edu Download Document from Source Website File Size: 404,48 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