Back to Results
First PageMeta Content
Information retrieval / Beam search / A* search algorithm / Heuristic function / Best-first search / Depth-first search / Breadth-first search / Beam diameter / Backtracking / Search algorithms / Artificial intelligence / Mathematics


Document Date: 2005-07-11 15:36:14


Open Document

File Size: 211,26 KB

Share Result on Facebook

City

Hanoi / /

Company

Wiley & Sons / Russell / The Intelligent Decision-Making Group / IEEE Computer Society Press / Original Limited / Generalized Limited / /

Country

United States / /

/

Facility

College of Computing / Towers of Hanoi / Georgia Institute of Technology / Limited Discrepancy Beam Search∗ David Furcy University of Wisconsin Oshkosh Computer Science Department Oshkosh / Peg Towers of Hanoi / Towers of Hanoi Our / Sven Koenig University of Southern California Computer Science Department Los Angeles / University of Massachusetts / /

IndustryTerm

post-processing step / heuristic search / maximum search tree depth / search prunes / Online Heuristic Search / depth-first search methods / approximation algorithm / search technique / guided best-first search / beam-search variants / memory-bounded search methods / linear-space best first search methods / breadth-first search / Memory-bounded bidirectional search / Divide-and-conquer beam search / Breadth-first heuristic search / Linear-space best-first search / linear-space search methods / beam search / commitment search / depth-bounded discrepancy search / search problems / search methods / search method / search search search pseudo code / memory-bounded search method / graph search / depthfirst search / band search / search trees / greedy search / intermediate beam depth-first beam search beam search / depth-first search / bestfirst search / discrepancy greedy search / post-processing / diversity beam search / search layer / search tree / multi-state commitment search methods / large search problems / Real-time heuristic search / breadthfirst search / discrepancy search / /

Organization

National Science Foundation / U.S. government / Sven Koenig University of Southern California Computer Science Department Los Angeles / University of Massachusetts / Amherst / University of Wisconsin Oshkosh Computer Science Department Oshkosh / Department of Computer Science / Georgia Institute of Technology / Atlanta / College of Computing / /

Person

Sven Koenig / /

/

Position

editor / /

Product

Manhattan / /

ProvinceOrState

Wisconsin / California / Georgia / Massachusetts / /

PublishedMedium

Annals of Mathematics / /

Region

Southern California / /

Technology

approximation algorithm / /

SocialTag