<--- Back to Details
First PageDocument Content
Applied mathematics / Hill climbing / Heuristic function / Best-first search / Local search / Algorithm / Lookahead / Automated planning and scheduling / Search algorithms / Artificial intelligence / Mathematics
Date: 2007-09-05 10:42:27
Applied mathematics
Hill climbing
Heuristic function
Best-first search
Local search
Algorithm
Lookahead
Automated planning and scheduling
Search algorithms
Artificial intelligence
Mathematics

Add to Reading List

Source URL: www.cis.strath.ac.uk

Download Document from Source Website

File Size: 212,88 KB

Share Document on Facebook

Similar Documents

A Graph-Partitioning Based Approach for Parallel Best-First Search 1 Yuu Jinnai 1,2 Center for Advanced Intelligence Project

DocID: 1uBU2 - View Document

Parallel Branch and Bound: Applying an Asynchronous Multi-Pool Approach to Cyclic Best First Search Joshua Gluck, Nartezya Dykes Swarthmore College, Spelman College, and The University of Illinois at Urbana-Champaign

DocID: 1tNGx - View Document

Parallel Randomized Best-First Minimax Search 1 Yaron Shoham 2, Sivan Toledo 3 School of Computer Science, Tel-Aviv University Abstract

DocID: 1tJDi - View Document

Graph theory / Information science / Information retrieval / Search algorithms / Routing algorithms / Combinatorial optimization / Game artificial intelligence / A* search algorithm / Query optimization / Path / PubMed / Best-first search

Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

DocID: 1pOdR - View Document

Jasper: the Art of Exploration in Greedy Best First Search Fan Xie and Martin Müller and Robert Holte Computing Science, University of Alberta Edmonton, Canada {fxie2,mmueller,robert.holte}@ualberta.ca

DocID: 1m63N - View Document