On the Optimality of Randomized \alpha-\beta Search
From MaRDI portal
On the Optimality of Randomized $\alpha$-$\beta$ Search
Recommendations
- Mathematical Foundations of Computer Science 2003
- A generalization of alpha-beta and SSS^* search procedures
- Random Binary Search: A Randomizing Algorithm for Global Optimization in R¹
- Generalized best-first search strategies and the optimality of A*
- scientific article; zbMATH DE number 4080680
- On the implementation of a class of stochastic search algorithms
- On Linear Convergence of a Class of Random Search Algorithms
- scientific article; zbMATH DE number 4031420
- Stochastic approximation search algorithms with randomization at the input
Cited in
(11)- Asymptotic properties of level-regular decision trees with randomly evaluated leaves
- Optimal Markov monotone symmetric random search
- scientific article; zbMATH DE number 437569 (Why is no real title available?)
- scientific article; zbMATH DE number 2127725 (Why is no real title available?)
- scientific article; zbMATH DE number 2127728 (Why is no real title available?)
- Optimal Search on Some Game Trees
- scientific article; zbMATH DE number 2085334 (Why is no real title available?)
- Evolutionary Computation in Combinatorial Optimization
- The effect of mobility on minimaxing of game trees with random leaf values
- Query strategies for priced information
- A randomized competitive algorithm for evaluating priced AND/OR trees
This page was built for publication: On the Optimality of Randomized $\alpha$-$\beta$ Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4326858)
