Success rates analysis of three hybrid algorithms on SAT instances

Title
Success rates analysis of three hybrid algorithms on SAT instances
Authors
Keywords
Success rate, Markov chain, Heuristic algorithms, Hybrid algorithm, Time complexity, Satisfiability
Journal
Swarm and Evolutionary Computation
Volume 34, Issue -, Pages 119-129
Publisher
Elsevier BV
Online
2017-02-09
DOI
10.1016/j.swevo.2017.02.001

Ask authors/readers for more resources

Reprint

Contact the author

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started