ENGLISH

Using Neutral Networks and Genetic Algorithms as Heuristics for NP-complete Problems

By Spears W.

Book information

Language
english
Format
GZ
Filesize
83 kB (85441 bytes)
Pages
5\5
Library
kolxoz
Time added
2009-07-20 03:45:11

Description

Paradigms for using neural networks (NNs) and genetic algorithms (GAs) to heuristicaJIy solve boolean satisfiability (SAT) problems are presented. Since SAT is NP-Complete, any olher NP-Compleie problem can be transformed into an equivalent SAT problem in polynomial Lime, and solved via either paradigm. This technique is illustrated for hamiltonian circuit (HC) problems.

Similar books