Skip to main navigation Skip to search Skip to main content

Parallel Genetic Algorithm to Solve the Satisfiability Problem

Research output: Contribution to journal › Article › peer-review

Abstract

This Paper Offers a Parallel Genetic Algorithm Solution to the Satisfiability Problem. It Combines Components of the Davis-Putnam Method and Genetic Algorithms for the Solution. This Solution is Useful in the Areas of Theorem Proving, Constraint Satisfaction Programming, and VLSI Design. the Algorithm is Implemented and Run on a Paragon. the Results Show Performance Improvement by Increasing the Number of Nodes. Two Parallel Methods Are Compared: One that Implements Interprocessor Communication and One that Does Not. the Results Show Performance Improvement with the Method that Uses Interprocessor Communication.

Original languageAmerican English
JournalProceedings of the ACM Symposium on Applied Computing
DOIs
StatePublished - Feb 27 1998

Keywords

  • David-Putnam method
  • Genetic algorithms
  • Model generation
  • Parallel processing
  • Satisfiability problem

Disciplines

  • Computer Sciences

Fingerprint

Dive into the research topics of 'Parallel Genetic Algorithm to Solve the Satisfiability Problem'. Together they form a unique fingerprint.

Cite this