English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Solving Satisfiability Problems with Genetic Algorithms

Harmeling, S. (2000). Solving Satisfiability Problems with Genetic Algorithms. In J. Koza (Ed.), Genetic Algorithms and Genetic Programming at Stanford 2000: Book of Student Papers from John Koza's Course at Stanford on Genetic Algorithms and Genetic Programming (pp. 206-213). Stanford, CA, USA: Stanford Bookstore.

Item is

Files

show Files
hide Files
:
genetic_sat.pdf (Any fulltext), 72KB
Name:
genetic_sat.pdf
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show
hide
Description:
-

Creators

show
hide
 Creators:
Harmeling, S1, Author              
Affiliations:
1External Organizations, ou_persistent22              

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. Type: -
 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: Book of Student Papers from John Koza's Course at Stanford on Genetic Algorithms and Genetic Programming
Source Genre: Book
 Creator(s):
Koza, JR, Editor
Affiliations:
-
Publ. Info: Stanford, CA, USA : Stanford Bookstore
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 206 - 213 Identifier: -