• DocumentCode
    2692638
  • Title

    A neural sorting network with O(1) time complexity

  • Author

    Chen, Wen-Tsuen ; Hsieh, Kuen-Rong

  • fYear
    1990
  • fDate
    17-21 June 1990
  • Firstpage
    87
  • Abstract
    A multilayer feedforward neural network is proposed to solve sorting problems. The network has O(n2) neurons and O(n2 ) links. The number of layers is fixed regardless of input size. Thus, the computation time of the network is independent of input size, and the sorting network has a time complexity of O(1)
  • Keywords
    computational complexity; neural nets; sorting; computation time; feedforward; multilayer; neural sorting network; time complexity;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1990., 1990 IJCNN International Joint Conference on
  • Conference_Location
    San Diego, CA, USA
  • Type

    conf

  • DOI
    10.1109/IJCNN.1990.137551
  • Filename
    5726513
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2692638