Maximizing over multiple pattern databases speeds up heuristic search (Q2457594): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.artint.2006.09.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2114629047
@@ Property / OpenAlex ID: W2114629047 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5715685
@@ Property / cites work: Q5715685 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624092
@@ Property / cites work: Q3624092 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4667106
@@ Property / cites work: Q4667106 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4536732
@@ Property / cites work: Q4536732 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing over multiple pattern databases speeds up heuristic search
+Normal rank
@@ Property / cites work @@
+Depth-first iterative-deepening: An optimal admissible tree search
+Normal rank
@@ Property / cites work @@
+Disjoint pattern database heuristics
@@ Property / cites work: Disjoint pattern database heuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Time complexity of iterative-deepening-\(A^{*}\)
@@ Property / cites work: Time complexity of iterative-deepening-\(A^{*}\) / rank @@
+Normal rank
@@ Property / cites work @@
+\(\text{BIDA}^*\): An improved perimeter search algorithm
+Normal rank
@@ Property / cites work @@
+Tools and Algorithms for the Construction and Analysis of Systems
+Normal rank
@@ Property / cites work @@
+Duality in permutation state spaces and the dual search algorithm
+Normal rank