Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets.
Serge GaspersGregory B. SorkinPublished in: ACM Trans. Algorithms (2017)
Keyphrases
- theoretical analysis
- learning algorithm
- orders of magnitude
- genetic algorithm
- similarity measure
- significant improvement
- computationally demanding
- worst case
- computationally efficient
- max csp
- memory efficient
- swarm intelligence
- benchmark datasets
- linear programming
- simulated annealing
- computational cost
- artificial intelligence