Pages that link to "Item:Q761039"

The following pages link to A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039):

Displaying 8 items.

• Optimization of heuristic search using recursive algorithm selection and reinforcement learning (Q647446) (← links)
• A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm (Q761039) (← links)
• A new result on the complexity of heuristic estimates for the \(A^*\) algorithm (Q1193486) (← links)
• A framework for analysing state-abstraction methods (Q2060741) (← links)
• A new algorithm design technique for hard problems (Q2173301) (← links)
• A formal analysis of why heuristic functions work (Q2457670) (← links)
• Survey on Directed Model Checking (Q3614878) (← links)
• AI 2003: Advances in Artificial Intelligence (Q5191621) (← links)