Performance of linear-space search algorithms (Q5917443): Difference between revisions

@@ Property / cites work @@
+Q3686500
@@ Property / cites work: Q3686500 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3943164
@@ Property / cites work: Q3943164 / 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 @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized best-first search strategies and the optimality of A*
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a linear diophantine problem of Frobenius
@@ Property / cites work: On a linear diophantine problem of Frobenius / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Postulates for subadditive processes
@@ Property / cites work: Postulates for subadditive processes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5727090
@@ Property / cites work: Q5727090 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic analysis of the complexity of A*
@@ Property / cites work: Probabilistic analysis of the complexity of A* / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for an optimal path in a tree with random costs
+Normal rank
@@ Property / cites work @@
+The first birth problem for an age-dependent branching process
+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 @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Bound Methods: A Survey
@@ Property / cites work: Branch-and-Bound Methods: A Survey / 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 @@
+Q3972640
@@ Property / cites work: Q3972640 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012185
@@ Property / cites work: Q4012185 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3867858
@@ Property / cites work: Q3867858 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the time complexity of iterative-deepening-\(A^*\)
+Normal rank
@@ Property / cites work @@
+Q5606305
@@ Property / cites work: Q5606305 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
+Normal rank
@@ Property / cites work @@
+Q3489496
@@ Property / cites work: Q3489496 / rank @@
+Normal rank
@@ Property / cites work @@
+Random Trees and the Analysis of Branch and Bound Procedures
+Normal rank
@@ Property / cites work @@
+The average complexity of depth-first search with backtracking and cutoff
+Normal rank
@@ Property / cites work @@
+Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
+Normal rank