Revision as of 14:57, 22 March 2007 edit Bissinger (talk \| contribs) 3,134 edits --Removed Linkless Status- You can help! ← Previous edit		Revision as of 05:20, 29 April 2007 edit undo 136.152.140.31 (talk) No edit summary Next edit →
Line 3: This search algorithm was put forward by Rong Zhou and Eric A. Hansen, Department of Computer Science and Engineering, [[Mississippi State University]] during the 15th International Conference on Automated Planning and Scheduling in [[Monterey, California]]. It could be ~~describes~~described as a method for transforming beam search into a complete search algorithm that is guaranteed to find an optimal solution. It uses a new data structure, called a beam stack, that makes it possible to integrate systematic backtracking with beam search.

Beam stack search: Difference between revisions