Pages that link to "Item:Q1232903"

The following pages link to On the complexity of admissible search algorithms (Q1232903):

Displaying 20 items.

• Inconsistent heuristics in theory and practice (Q646508) (← links)
• A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
• A heuristic search algorithm with modifiable estimate (Q792766) (← links)
• Heuristic search for one-to-many shortest path queries (Q825009) (← links)
• A new bidirectional search algorithm with shortened postprocessing (Q1026755) (← links)
• A method for computing heuristics in problem solving (Q1143823) (← links)
• Probabilistic analysis of the complexity of A* (Q1146526) (← links)
• Knowledge versus search: a quantitative analysis using A* (Q1170890) (← links)
• Utility of pathmax in partial order heuristic search (Q1352123) (← links)
• An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
• A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068) (← links)
• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization (Q1592632) (← links)
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle (Q1677446) (← links)
• Remarks on the \(\mathrm A^{\ast\ast}\) algorithm (Q2254543) (← links)
• (Q3033346) (← links)
• Heuristic tree search with nonparametric statistical inference methods (Q3210918) (← links)
• Heuristic estimates in shortest path algorithms (Q5422014) (← links)
• Heuristic search strategies for multiobjective state space search (Q5955789) (← links)
• Boosting optimal symbolic planning: operator-potential heuristics (Q6592992) (← links)
• Heuristically ordered search in state graphs (Q6602248) (← links)