A measure of combinational landscape difficulty for the Metropolis algorithm.
Meriema BelaidouniJin-Kao HaoPublished in: AI&M (2000)
Keyphrases
- high accuracy
- simulated annealing
- experimental evaluation
- np hard
- similarity measure
- optimal solution
- learning algorithm
- preprocessing
- significant improvement
- neural network
- matching algorithm
- optimization algorithm
- theoretical analysis
- computational cost
- search space
- cost function
- recognition algorithm
- computational complexity
- path planning
- classification algorithm
- segmentation algorithm
- detection algorithm
- decision trees
- times faster
- data sets
- monte carlo
- genetic algorithm
- computationally efficient
- em algorithm
- input data
- linear programming
- feature space
- k means