<--- Back to Details
First PageDocument Content
Parallel computing / Search algorithms / Operations research / A* search algorithm / And–or tree / Speedup / Scheduling / Algorithm / Breadth-first search / Computing / Concurrent computing / Mathematics
Date: 2011-08-01 14:25:30
Parallel computing
Search algorithms
Operations research
A* search algorithm
And–or tree
Speedup
Scheduling
Algorithm
Breadth-first search
Computing
Concurrent computing
Mathematics

August 1, [removed]:25 paper

Add to Reading List

Source URL: charm.cs.illinois.edu

Download Document from Source Website

File Size: 589,60 KB

Share Document on Facebook

Similar Documents

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