libcats.org
Главная

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

Нет обложки

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

Paradigms for using neural networks (NNs) and genetic algorithms (GAs) to heuristieally solve boolean satisfiability (SAT) problems are presented. Results are presented for two-peak and false-peak SAT problems. Since SAT is NP-Complete, any other NP-Complete problem can be transformed into an equivalent SAT problem in polynomial time, and solved via either paradigm. This technique is illustrated for hamiltonian circuit (HC) problems.
Популярные книги за неделю:

Каникулы

Автор:
Размер книги: 13 Kb

Can Corporations Be Citizens

Автор:
Категория: Business Ethics
Размер книги: 1.69 Mb

Момент истины. В августе 44-го

Автор:
Категория: ИСТОРИЯ
Размер книги: 1.52 Mb

Mein Kampf

Автор:
Категория: fiction
Размер книги: 701 Kb
Только что пользователи скачали эти книги: