DocumentCode
1186055
Title
Efficient implementation of heuristic search
Author
Martens, Jean-Pierre
Volume
30
Issue
21
fYear
1994
fDate
10/13/1994 12:00:00 AM
Firstpage
1748
Lastpage
1749
Abstract
The heuristic search algorithm presented by Nilsson (1980) is commonly implemented with lists. However, the computational complexity of this implementation grows quadratically with the number of nodes being visited. The implementation presented has a computational complexity which is proportional to that number. Moreover, the storage requirements can be kept modest by introducing a late allocation strategy
Keywords
computational complexity; search problems; computational complexity; heuristic search algorithm; late allocation strategy;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19941203
Filename
328547
Link To Document