Pages that link to "Item:Q1837544"

The following pages link to A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures (Q1837544):

Displaying 13 items.

• Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
• General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
• The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad (Q915453) (← links)
• A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524) (← links)
• Parallel depth first search. I: Implementation (Q1116343) (← links)
• Branch-and-bound as a higher-order function (Q1179748) (← links)
• Game tree algorithms and solution trees (Q1589517) (← links)
• A minimax algorithm better than alpha-beta? Yes and no (Q1837546) (← links)
• The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
• A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi (Q5941318) (← links)
• Trends in game tree search (Q6560188) (← links)
• Towards an abstract parallel branch and bound machine (Q6560207) (← links)