Pages that link to "Item:Q1321063"
From MaRDI portal
The following pages link to Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search (Q1321063):
Displaying 13 items.
- Solving job shop problems in the context of hypergraphs (Q351548) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- Heuristic search in restricted memory (Q1263290) (← links)
- An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
- On fast path-finding algorithms in AND-OR graphs (Q1886199) (← links)
- An accelerated search on the graph: PROLOG representation (Q2764343) (← links)
- Algorithms for generating ordered solutions for explicit AND/OR structures (Q2905385) (← links)
- (Q3570515) (← links)
- AND/OR graph heuristic search methods (Q3771665) (← links)
- A general best first search algorithm in AND/OR graphs (Q3990604) (← links)
- (Q4204018) (← links)
- Searching for a minimal solution subgraph in explicit AND/OR graphs (Q5936461) (← links)
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)
