Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Korf, Richard Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 6 reviews    
  Space-efficient search algorithms
Korf R. ACM Computing Surveys 27(3): 337-339, 1995.  Type: Article

Several search algorithms that provide workable solutions under limited memory constraints are surveyed. Many combinatorial optimization problems and constraint satisfaction problems use heuristic searches whose memory requirement grow...
...
Dec 1 1996  
  Real-time heuristic search
Korf R. Artificial Intelligence 42(2-3): 189-211, 1990.  Type: Article

The author discusses several reasons why a heuristic search algorithm for single-agent problems should not always be run until a solution is found, but instead (as in game-tree search) should be carried out to a specified depth and the...
...
Jan 1 1991  
  Planning as search: a quantitative approach
Korf R. Artificial Intelligence 33(1): 65-68, 1987.  Type: Article

That the state of knowledge in various subfields of artificial intelligence has advanced from qualitative statements to quantitative results is exemplified by the body of results concerning the performance of heuristic search algorithm...
...
Aug 1 1989  
  Learning to solve problems by searching for macro-operators
Korf R., Pitman Publishing, Inc., Marshfield, MA, 1985.  Type: Book (9789780273086901)

The purpose of this monograph (a revised doctoral dissertation) is to describe and demonstrate the derivation and use of efficient macro-operators. Macro-operators serve to automate the solution of problems which are characterized by n...
...
Jul 1 1986  
  Depth-first iterative-deepening: an optimal admissible tree search
Korf R. Artificial Intelligence 27(1): 97-109, 1985.  Type: Article

In this interesting and easy-to-understand paper, the author points out the advantages in using the Depth-First Iterative-Deepening (DFID) approach over the depth-first and breadth-first searches. The DFID method works as follows: Perf...
...
May 1 1986  

 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy