Referenced Items are not available for this document.
The paper compares two evolutionary methods for model finding in the satisfiability problem (SAT): genetic algorithms (GAs) and the mask method (MASK). The main characteristics of these two methods are that both of them are population-based, and use binary representation. Great care is taken to make sure that the same SAT instances and the same criteria are used in the comparison. Results indicate that MASK greatly outperforms GAs in the sense that MASK manages to deal with harder SAT instances at a lower cost
Date of Conference: 27-29 Jun 1994
- Page(s):
- 450 - 455 vol.1
- Meeting Date :
- 27 Jun 1994-29 Jun 1994
- Print ISBN:
- 0-7803-1899-4
- INSPEC Accession Number:
- 4818683
- Conference Location :
- Orlando, FL
- Digital Object Identifier :
- 10.1109/ICEC.1994.349908
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
