TY - BOOK
T1 - The construction of minimal multi-layered perceptrons : a case study for sorting
AU - Zwietering, P.J.
AU - Aarts, E.H.L.
AU - Wessels, J.
PY - 1992
Y1 - 1992
N2 - We consider the construction of minimal multi-layered perceptrons for solving combinatorial optimization problems. Though general in nature, the 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(n^2) three-layered perceptron, which can be viewed as a neural implementation of Preparata's parallel enumerative sorting algorithm. Key words: minimal multi-layered percept1'Ons, feed-forward neural networks, combinatorial optimization problems, sorting.
AB - We consider the construction of minimal multi-layered perceptrons for solving combinatorial optimization problems. Though general in nature, the 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(n^2) three-layered perceptron, which can be viewed as a neural implementation of Preparata's parallel enumerative sorting algorithm. Key words: minimal multi-layered percept1'Ons, feed-forward neural networks, combinatorial optimization problems, sorting.
M3 - Book
T3 - Memorandum COSOR
BT - The construction of minimal multi-layered perceptrons : a case study for sorting
PB - Technische Universiteit Eindhoven
CY - Eindhoven
ER -