Potential-based bounded-cost search and anytime non-parametric A* (Q2014923): Difference between revisions

@@ Property / author @@
-Jur P. van den Berg
@@ Property / author: Jur P. van den Berg / rank @@
-Normal rank
@@ Property / author @@
-Ken Goldberg
@@ Property / author: Ken Goldberg / rank @@
-Normal rank
@@ Property / author @@
+Jur P. van den Berg
@@ Property / author: Jur P. van den Berg / rank @@
+Normal rank
@@ Property / author @@
+Ken Goldberg
@@ Property / author: Ken Goldberg / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.artint.2014.05.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2126113409
@@ Property / OpenAlex ID: W2126113409 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-first iterative-deepening: An optimal admissible tree search
+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 @@
+Q2747613
@@ Property / cites work: Q2747613 / 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 @@
+Heuristic search viewed as path finding in a graph
+Normal rank
@@ Property / cites work @@
+Studies in Semi-Admissible Heuristics
@@ Property / cites work: Studies in Semi-Admissible Heuristics / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624053
@@ Property / cites work: Q3624053 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3686500
@@ Property / cites work: Q3686500 / rank @@
+Normal rank
@@ Property / cites work @@
+Solution counting algorithms for constraint-centered search heuristics
+Normal rank
@@ Property / cites work @@
+Q5715685
@@ Property / cites work: Q5715685 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
+Normal rank
@@ Property / cites work @@
+Q2880929
@@ Property / cites work: Q2880929 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing over multiple pattern databases speeds up heuristic search
+Normal rank
@@ Property / cites work @@
+Duality in permutation state spaces and the dual search algorithm
+Normal rank
@@ Property / cites work @@
+The centrality of groups and classes
@@ Property / cites work: The centrality of groups and classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q5852580
@@ Property / cites work: Q5852580 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental deployment of network monitors based on Group Betweenness Centrality
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / 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 @@
+Performance of linear-space search algorithms
@@ Property / cites work: Performance of linear-space search algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Predicting the size of IDA\(^*\)'s search tree
@@ Property / cites work: Predicting the size of IDA\(^*\)'s search tree / 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 @@
+Q3624014
@@ Property / cites work: Q3624014 / rank @@
+Normal rank