A simple algorithm for sampling colourings of G(n, d/n) up to Gibbs Uniqueness Threshold.
Charilaos EfthymiouPublished in: CoRR (2016)
Keyphrases
- monte carlo
- preprocessing
- np hard
- dynamic programming
- computationally efficient
- particle swarm optimization
- detection algorithm
- optimization algorithm
- significant improvement
- improved algorithm
- worst case
- matching algorithm
- input data
- simulated annealing
- cost function
- roc curve
- optimal solution
- similarity measure
- learning algorithm
- convergence rate
- times faster
- random sampling
- genetic algorithm
- sampling strategy
- high accuracy
- computational cost
- multi objective
- k means
- search space
- computational complexity