<--- Back to Details
First PageDocument Content
Search algorithms / Heuristics / Mathematics / Cognition / Admissible heuristic / Graphplan / Computational complexity theory / Algorithm / Hyper-heuristic / Book:Graph Theory
Date: 2000-09-17 18:28:48
Search algorithms
Heuristics
Mathematics
Cognition
Admissible heuristic
Graphplan
Computational complexity theory
Algorithm
Hyper-heuristic
Book:Graph Theory

AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

Add to Reading List

Source URL: rakaposhi.eas.asu.edu

Download Document from Source Website

File Size: 144,77 KB

Share Document on Facebook

Similar Documents

Fast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search

Fast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search

DocID: 1oWMc - View Document

Reviving Partial Order Planning XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZEmail: fxuanlong,

Reviving Partial Order Planning XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZEmail: fxuanlong,

DocID: 1nR2o - View Document

AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

AltAlt: Combining the Advantages of Graphplan and Heuristic State Search Romeo Sanchez Nigenda, XuanLong Nguyen & Subbarao Kambhampati Department of Computer Science and Engineering Arizona State University, Tempe AZ 852

DocID: 1nrAT - View Document

Online Generation and Use of Macro-Actions in Forward-Chaining Planning Amanda Smith  A Thesis submitted for the degree of Doctor of Philosophy

Online Generation and Use of Macro-Actions in Forward-Chaining Planning Amanda Smith A Thesis submitted for the degree of Doctor of Philosophy

DocID: 18VEv - View Document

FF: The Fast-Forward Planning System Jorg Homann Institute for Computer Science Albert Ludwigs University Georges-Kohler-Allee, Geb. 52

FF: The Fast-Forward Planning System Jorg Ho mann Institute for Computer Science Albert Ludwigs University Georges-Kohler-Allee, Geb. 52

DocID: 15H22 - View Document