Iterative Deepening Dynamically Improved Bounds Bidirectional Search (Q5086001): Difference between revisions

@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Bidirectional Heuristic Search Again
@@ Property / cites work: Bidirectional Heuristic Search Again / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for sorting by prefix reversal
@@ Property / cites work: Bounds for sorting by prefix reversal / rank @@
+Normal rank
@@ Property / cites work @@
+MM: a bidirectional search algorithm that is guaranteed to meet in the middle
+Normal rank
@@ Property / cites work @@
+Q4386972
@@ Property / cites work: Q4386972 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-first iterative-deepening: An optimal admissible tree search
+Normal rank
@@ Property / cites work @@
+\(BS^*:\) An admissible bidirectional staged heuristic search algorithm
+Normal rank
@@ Property / cites work @@
+Finding the Shortest Route between Two Points in a Network
+Normal rank
@@ Property / cites work @@
+Heuristic search viewed as path finding in a graph
+Normal rank
@@ Property / cites work @@
+Q5679703
@@ Property / cites work: Q5679703 / rank @@
+Normal rank
@@ Property / cites work @@
+The Diameter of the Rubik's Cube Group Is Twenty
@@ Property / cites work: The Diameter of the Rubik's Cube Group Is Twenty / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamically improved bounds bidirectional search
@@ Property / cites work: Dynamically improved bounds bidirectional search / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Bidirectional Heuristic Search Algorithm
+Normal rank