Controlling the learning process of real-time heuristic search (Q814454): Difference between revisions

@@ Property / cites work @@
+Q4001523
@@ Property / cites work: Q4001523 / rank @@
+Normal rank
@@ Property / cites work @@
+Planning as heuristic search
@@ Property / cites work: Planning as heuristic search / rank @@
+Normal rank
@@ Property / cites work @@
+Agent searching in a tree and the optimality of iterative deepening
+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 @@
+Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases
+Normal rank
@@ Property / cites work @@
+Q4347106
@@ Property / cites work: Q4347106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012191
@@ Property / cites work: Q4012191 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax real-time heuristic search
@@ Property / cites work: Minimax real-time heuristic search / 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 @@
+Q5626306
@@ Property / cites work: Q5626306 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic search viewed as path finding in a graph
+Normal rank
@@ Property / cites work @@
+The \((n^ 2-1)\)-puzzle and related relocation problems
+Normal rank