Complexity of Max-SAT using stochastic algorithms

doi:10.1145/1389095.1389219

Complexity of Max-SAT using stochastic algorithms

Full Text:

PDF

Buy this Article

Authors:	Mohamed Qasem	University of Southampton, Southampton, SO17 1BJ, United Kingdom
	Adam Prugel-Bennett	University of Southampton, Southampton, SO17 1BJ, United Kingdom

Published in:

	· Proceeding
	GECCO '08 Proceedings of the 10th annual conference on Genetic and evolutionary computation
	ACM New York, NY, USA ©2008 table of contents ISBN: 978-1-60558-130-9 doi>10.1145/1389095.1389219

	2008 Article Poster
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 12 · Citation Count: 3

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- GECCO '12

Tags: algorithms heuristic methods hill-climbing. maximum satisfiability performance phase transition probabilistic algorithms reliability satisfiability

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player