Back to Results
First PageMeta Content
Artificial intelligence / Depth-first search / Iterative deepening depth-first search / A* search algorithm / Tree traversal / Tree / Heuristic function / B-tree / Search algorithms / Mathematics / Graph theory


Exploiting Belief State Structure in Graph Search Jason Wolfe and Stuart Russell Computer Science Division University of California, Berkeley, CA[removed]removed], [removed]
Add to Reading List

Document Date: 2007-08-07 01:46:00

Open Document

File Size: 270,89 KB

Share Result on Facebook

Company

Prentice-Hall / /

/

Facility

University of Mannheim / Stuart Russell Computer Science Division University of California / University of Limburg / Providence airport / /

IndustryTerm

search strategies / graph search / baseline algorithms / incremental search framework / simplest belief-state graph algorithm / graph algorithm / above search procedure / adversarial graph search / depth-first search / tree search algorithms / search procedure / fragPlan algorithm / graph-search variants / state-space graph search / idea to search algorithm / possible search dimension / search problems / subset/superset query algorithms / search algorithms / /

Organization

Artificial Copyright Intelligence / University of California / Berkeley / University of Limburg / Association for the Advancement / University of Mannheim / /

Person

Stuart Russell / /

/

Position

player / /

ProvinceOrState

Manitoba / /

PublishedMedium

ICGA Journal / /

Technology

DFS= algorithm / subset/superset query algorithms / second graph algorithm / baseline algorithms / artificial intelligence / six algorithms / search algorithms / tree search algorithms / previously existing algorithm / fragPlan algorithm / six implemented algorithms / caching / second algorithm / six search algorithms / DFS= Algorithm The simplest belief-state graph algorithm / four algorithms / 6 algorithms / two algorithms / /

URL

www.aaai.org / http /

SocialTag