The following pages link to (Q5585003):
Displaying 10 items.
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- Game tree searching by min/max approximation (Q1096402) (← links)
- Using rewriting rules for connection graphs to prove theorems (Q1137877) (← links)
- Completely non-clausal theorem proving (Q1157923) (← links)
- Generalized AND/OR graphs (Q1228371) (← links)
- DATAPLAN: An interface generator for database semantics (Q1230648) (← links)
- Problem representations and formal properties of heuristic search (Q1238643) (← links)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544) (← links)
- Best-first minimax search (Q2171269) (← links)
- LAO*: A heuristic search algorithm that finds solutions with loops (Q5941311) (← links)