Abstract
We consider the construction of minimal multilayered perceptrons for solving combinatorial optimization problems. Though general in nature, the proposed construction method is presented as a case study for the sorting problem. The presentation starts with an O((n!)2) three-layered perceptron based on complete enumeration, that solves the sorting problem of n numbers. This network is then gradually reduced to an O(n2) three-layered perceptron, which can be viewed as a neural implementation of Preparata's parallel enumerative sorting algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 197-210 |
| Number of pages | 14 |
| Journal | Neurocomputing |
| Volume | 5 |
| Issue number | 4-5 |
| DOIs | |
| Publication status | Published - 1993 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'The construction of minimal multilayered perceptrons : a case study for sorting'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver