A computational procedure for estimation of the mixing time of the random-scan Metropolis algorithm.
David A. SpadePublished in: Stat. Comput. (2016)
Keyphrases
- dynamic programming
- estimation accuracy
- optimization algorithm
- computational complexity
- estimation algorithm
- times faster
- objective function
- preprocessing
- k means
- np hard
- randomly generated
- high accuracy
- segmentation algorithm
- single scan
- learning algorithm
- simulated annealing
- experimental evaluation
- optimal solution
- theoretical analysis
- particle swarm optimization
- convergence rate
- recognition algorithm
- improved algorithm
- recursive algorithm
- bit rate
- detection algorithm
- metaheuristic
- significant improvement
- search space