Name
Abstract | ||
|---|---|---|
Frontier search is a new search technique that achieves important memory savings over previous best-first search algorithms. This paper describes an extension of frontier search to bicriterion graph search problems that achieves also important memory savings. The new algorithm is evaluated using a set of random problems. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.3233/978-1-58603-891-5-480 | ECAI |
Keywords | Field | DocType |
random problem,previous best-first search algorithm,frontier search,new algorithm,new search technique,graph search problem,bicriterion shortest path problems,important memory saving,shortest path problem | Incremental heuristic search,Mathematical optimization,Search algorithm,Shortest path problem,Computer science,Beam search,Artificial intelligence,Bidirectional search,Frontier,Machine learning,Best-first search,K shortest path routing | Conference |
Volume | ISSN | Citations |
178 | 0922-6389 | 5 |
PageRank | References | Authors |
0.47 | 10 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. Mandow | 1 | 86 | 6.91 |
| Jesús De La Cruz | 2 | 271 | 26.56 |