A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Search Algorithms Under Different Kinds of Heuristics—A Comparative Study
+Normal rank
@@ Property / cites work @@
+Heuristic search through islands
@@ Property / cites work: Heuristic search through islands / rank @@
+Normal rank
@@ Property / cites work @@
+On the optimality of A
@@ Property / cites work: On the optimality of A / rank @@
+Normal rank
@@ Property / cites work @@
+The heuristic search under conditions of error
@@ Property / cites work: The heuristic search under conditions of error / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Dominance Relations in Branch-and-Bound Algorithms
+Normal rank
@@ Property / cites work @@
+Depth-first iterative-deepening: An optimal admissible tree search
+Normal rank
@@ Property / cites work @@
+On the complexity of admissible search algorithms
@@ Property / cites work: On the complexity of admissible search algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic search algorithm with modifiable estimate
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01531177
+Normal rank
@@ Property / OpenAlex ID @@
+W2026091073
@@ Property / OpenAlex ID: W2026091073 / rank @@
+Normal rank