全球智库信息集成服务系统(G2TT): The minimal number of layers of a perceptron that sorts.

G2TT

来源类型	Article
规范类型	其他
DOI	10.1006/jpdc.1994.1034
	The minimal number of layers of a perceptron that sorts.
	Zwietering PJ; Aarts EHL; Wessels J
发表日期	1994
出处	Journal of Parallel and Distributed Computing 20 (3): 380-387
出版年	1994
语种	英语
摘要	In this paper we consider the problem of determining the minimal number of layers required by a multilayered perceptron for solving the problem of sorting a set of real-valued numbers. We discuss two formulations of the sorting problem; ABSSORT, which can be considered as the standard form of the sorting problem, and for which, given an array of numbers, a new array with the original numbers in ascending order is requested, and RELSORT, for which, given an array of numbers, one wants first to find the smallest number, and then for each number-except the largest-one wants to find the number that comes next in size. We show that, if one uses classical multilayered perceptrons with the hard-limiting response function, the minimal numbers of layers needed are 3 and 2 for solving ABSSORT and RELSORT, respectively.
主题	Methodology of Decision Analysis (MDA)
URL	http://pure.iiasa.ac.at/id/eprint/3869/
来源智库	International Institute for Applied Systems Analysis (Austria)
引用统计
资源类型	智库出版物
条目标识符	http://119.78.100.153/handle/2XGU8XDN/127260
推荐引用方式 GB/T 7714	Zwietering PJ,Aarts EHL,Wessels J. The minimal number of layers of a perceptron that sorts.. 1994.