Loading...
Please wait, while we are loading the content...
Similar Documents
Using Neural Networks and Genetic Algorithms as Heuristics for NP-Complete Problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Spears, William M. Jong, Kenneth A. De |
| Copyright Year | 1989 |
| Abstract | Paradigms for using neural networks (NNs) and genetic algorithms (GAs) to heuristically solve boolean satisfiability (SAT) problems are presented. 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.aic.nrl.navy.mil/~spears/papers/ijcnn90.ps.gz |
| Alternate Webpage(s) | http://www.swarmotics.com/uploads/ijcnn90.pdf |
| Alternate Webpage(s) | http://www.swarmotics.com/uploads/masters.pdf |
| Alternate Webpage(s) | http://www.cs.uwyo.edu/~wspears/papers/masters.pdf |
| Alternate Webpage(s) | http://www.aic.nrl.navy.mil/~spears/papers/masters.ps.gz |
| Alternate Webpage(s) | http://www.cs.uwyo.edu/~wspears/papers/ijcnn90.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |