Generating functions and the performance of backtracking adaptive search
From MaRDI portal
Recommendations
- Backtracking adaptive search: distribution of number of iterations to convergence
- Expected search duration for finite backtracking adaptive search
- Expected hitting times for Backtracking Adaptive Search
- Approximation of the distribution of convergence times for stochastic global optimisation
- Stochastic adaptive search for global optimization.
Cites work
- Approximation of the distribution of convergence times for stochastic global optimisation
- Backtracking adaptive search: distribution of number of iterations to convergence
- Hesitant adaptive search for global optimisation
- Hesitant adaptive search: The distribution of the number of iterations to convergence
- Implementing pure adaptive search for global optimization using Markov chain sampling
- Implementing pure adaptive search with Grover's quantum algorithm
- Pure adaptive search in global optimization
Cited in
(6)- Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise
- Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation
- Markov modelling and parameterisation of genetic evolutionary test generations
- Backtracking adaptive search: distribution of number of iterations to convergence
- Expected search duration for finite backtracking adaptive search
- Expected hitting times for Backtracking Adaptive Search
This page was built for publication: Generating functions and the performance of backtracking adaptive search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995932)
