Agent searching in a tree and the optimality of iterative deepening (Q1341670): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/0004-3702(94)90066-3
-Normal rank
@@ Property / OpenAlex ID @@
-W2084717646
@@ Property / OpenAlex ID: W2084717646 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0004-3702(94)90066-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2084717646
@@ Property / OpenAlex ID: W2084717646 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in the plane
@@ Property / cites work: Searching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel searching in the plane
@@ Property / cites work: Parallel searching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic search in restricted memory
@@ Property / cites work: Heuristic search in restricted memory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012191
@@ Property / cites work: Q4012191 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-first iterative-deepening: An optimal admissible tree search
+Normal rank
@@ Property / cites work @@
+Real-time heuristic search
@@ Property / cites work: Real-time heuristic search / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-space best-first search
@@ Property / cites work: Linear-space best-first search / rank @@
+Normal rank
@@ Property / cites work @@
+On the asymptotic performance of IDA
@@ Property / cites work: On the asymptotic performance of IDA / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths without a map
@@ Property / cites work: Shortest paths without a map / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
+Normal rank