English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Solving Satisfiability Problems with Genetic Algorithms

Harmeling, S. (2000). Solving Satisfiability Problems with Genetic Algorithms. In Genetic Algorithms and Genetic Programming at Stanford 2000 (pp. 206-213). Stanford, CA, USA: Stanford Bookstore.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0013-E4D4-5 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0013-E4D5-3
Genre: Book Chapter

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Harmeling, S1, Author              
Koza, J. R., Editor
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              

Content

show
hide
Free keywords: -
 Abstract: We show how to solve hard 3-SAT problems using genetic algorithms. Furthermore, we explore other genetic operators that may be useful to tackle 3-SAT problems, and discuss their pros and cons.

Details

show
hide
Language(s):
 Dates: 2000-06
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: -
 Identifiers: BibTex Citekey: 6366
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Genetic Algorithms and Genetic Programming at Stanford 2000
Source Genre: Book
 Creator(s):
Affiliations:
Publ. Info: Stanford, CA, USA : Stanford Bookstore
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 206 - 213 Identifier: -