Pages that link to "Item:Q1263290"

The following pages link to Heuristic search in restricted memory (Q1263290):

Displaying 16 items.

• On the abstraction method for the container relocation problem (Q342301) (← links)
• Optimization of heuristic search using recursive algorithm selection and reinforcement learning (Q647446) (← links)
• Linear-space best-first search (Q685539) (← links)
• Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
• Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds (Q1187216) (← links)
• Effective use of memory in iterative deepening search (Q1198022) (← links)
• Proof-number search (Q1321057) (← links)
• Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search (Q1321063) (← links)
• Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
• Utility of pathmax in partial order heuristic search (Q1352123) (← links)
• \(\text{BIDA}^*\): An improved perimeter search algorithm (Q1855228) (← links)
• Best-first minimax search (Q2171269) (← links)
• Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
• Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
• HEURISTIC SEARCH UNDER CONTRACT (Q3224350) (← links)