Pages that link to "Item:Q2549574"

The following pages link to An admissible and optimal algorithm for searching AND/OR graphs (Q2549574):

Displaying 20 items.

• A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524) (← links)
• On branching and looping. I (Q1134530) (← 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)
• Optimal problem-solving search: All-or-none solutions (Q1226866) (← links)
• Generalized AND/OR graphs (Q1228371) (← links)
• Semantics in problem representation and search (Q1233326) (← links)
• Problem representations and formal properties of heuristic search (Q1238643) (← links)
• An integrated model of problem solver (Q1242838) (← links)
• An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
• The heuristic search under conditions of error (Q1846741) (← links)
• A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products (Q1954925) (← links)
• Computer science and decision theory (Q2271874) (← links)
• An AO^* Based Exact Algorithm for the Canadian Traveler Problem (Q2806869) (← links)
• (Q5005146) (← links)
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS (Q5696968) (← links)
• Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation (Q5862674) (← links)
• Searching for a minimal solution subgraph in explicit AND/OR graphs (Q5936461) (← links)
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)