<--- Back to Details
First PageDocument Content
Game artificial intelligence / Routing algorithms / Computer programming / Computing / Mathematics / Automated planning and scheduling / Theoretical computer science / Macro / Satisficing / A* search algorithm / Planning Domain Definition Language / Heuristic
Date: 2016-06-09 08:09:18
Game artificial intelligence
Routing algorithms
Computer programming
Computing
Mathematics
Automated planning and scheduling
Theoretical computer science
Macro
Satisficing
A* search algorithm
Planning Domain Definition Language
Heuristic

Exploiting Search Space Structure in Classical Planning: Analyses and Algorithms (Dissertation Abstract) Masataro Asai Graduate School of Arts and Sciences University of Tokyo

Add to Reading List

Source URL: icaps16.icaps-conference.org

Download Document from Source Website

File Size: 215,04 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

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

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

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

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

________________________________ 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