A NEURAL SORTING NETWORK WITH O(1) TIME-COMPLEXITY

被引:6
|
作者
CHEN, WT
HSIEH, KR
机构
[1] Department of Computer Science, National Tsing Hua University, Hsinchu
关键词
PARALLEL PROCESSING; SORTING; NEURAL NETWORK;
D O I
10.1016/0020-0190(93)90042-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:309 / 313
页数:5
相关论文
共 50 条
  • [1] A NOTE ON NEURAL SORTING NETWORKS WITH O(1) TIME-COMPLEXITY
    YAO, X
    INFORMATION PROCESSING LETTERS, 1995, 56 (05) : 253 - 254
  • [2] A low-cost neural sorting network with O(1) time complexity
    Lin, SS
    Hsu, SH
    NEUROCOMPUTING, 1997, 14 (03) : 289 - 299
  • [3] An O(1) time complexity sorting network for small number of inputs with hardware implementation
    Jelodari, Parham Taghinia
    Kordasiabi, Mojtaba Parsa
    Sheikhaei, Samad
    Forouzandeh, Behjat
    MICROPROCESSORS AND MICROSYSTEMS, 2020, 77
  • [4] SRR:: An O(1) time-complexity packet scheduler for flows in multiservice packet networks
    Guo, CX
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2004, 12 (06) : 1144 - 1155
  • [5] EQUIVALENCE IN TIME-COMPLEXITY OF SEVERAL PROBLEMS
    IVANOV, EA
    CYBERNETICS, 1983, 19 (06): : 769 - 774
  • [6] ON THE AVERAGE TIME-COMPLEXITY OF SET PARTITIONING
    SPECKENMEYER, E
    KEMP, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 440 : 369 - 381
  • [7] A NOTE ON DETERMINISTIC AND NONDETERMINISTIC TIME-COMPLEXITY
    EVEN, S
    LONG, TJ
    YACOBI, Y
    INFORMATION AND CONTROL, 1982, 55 (1-3): : 117 - 124
  • [8] On the Time-Complexity of Robust and Amnesic Storage
    Dobre, Dan
    Majuntke, Matthias
    Suri, Neeraj
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 12TH INTERNATIONAL CONFERENCE, OPODIS 2008, 2008, 5401 : 197 - 216
  • [9] ON THE TIME-COMPLEXITY FOR CIRCUMSCRIBING A CONVEX POLYGON
    WOO, TC
    LEE, HC
    COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 30 (03): : 362 - 363
  • [10] RESERVOIR-SAMPLING ALGORITHMS OF TIME-COMPLEXITY O(N(1+LOG(N/N)))
    LI, KH
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1994, 20 (04): : 481 - 493