Name
Abstract | ||
|---|---|---|
We present the General Search Procedure (GSP) that provides a unifying way of describing search algorithms. The GSP captures both constructive and iterative search algorithms. We demonstrate as an exercise that various well-known heuristic search procedures can be obtained as instances of the GSP. The introduced formalism provides a solid ground to prove theoretical properties of search methods. Furthermore, by the formal approach we obtain a framework that can serve as the basis of implementing a search based problem solver. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BF02031717 | Annals OR |
Keywords | Field | DocType |
search algorithm,heuristic search | Mathematical optimization,Incremental heuristic search,Search algorithm,Guided Local Search,Beam stack search,Beam search,Theoretical computer science,Combinatorial search,Mathematics,Best-first search,Iterative deepening depth-first search | Journal |
Volume | Issue | ISSN |
55 | 1 | 1572-9338 |
Citations | PageRank | References |
3 | 0.60 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. E. Eiben | 1 | 2107 | 377.70 |
| Emile H. L. Aarts | 2 | 1641 | 307.48 |
| K. M. van Hee | 3 | 149 | 14.34 |
| W. P. M. Nuijten | 4 | 14 | 2.32 |