EXPECTED TIME-COMPLEXITY OF A NEW CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS

被引：0
|
作者：
VANDERNAT, M
机构：
来源：
ANGEWANDTE INFORMATIK | 1987年 / 12期
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：533 / 536
页数：4
相关论文
共 20 条
  • [11] NEW SHARPNESS PROPERTIES, ALGORITHMS AND COMPLEXITY-BOUNDS FOR PARTITIONING SHORTEST-PATH PROCEDURES
    GLOVER, F
    KLINGMAN, D
    OPERATIONS RESEARCH, 1989, 37 (04) : 542 - 546
  • [12] A new class of heuristic polynomial time algorithms to solve the multidimensional assignment problem
    Perea, F.
    de Waard, H. W.
    2006 9th International Conference on Information Fusion, Vols 1-4, 2006, : 581 - 588
  • [13] New approach for splitting a class of real-time algorithms for pipelined processing
    Sinha, A
    Sinha, A
    Choudhury, S
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 1997, 12 (03): : 213 - 220
  • [14] A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
    Tjen-Sien Lim
    Wei-Yin Loh
    Yu-Shan Shih
    Machine Learning, 2000, 40 : 203 - 228
  • [15] A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms
    Lim, TS
    Loh, WY
    Shih, YS
    MACHINE LEARNING, 2000, 40 (03) : 203 - 228
  • [16] A New Approach for Analyzing Average Time Complexity of Population-Based Evolutionary Algorithms on Unimodal Problems
    Chen, Tianshi
    He, Jun
    Sun, Guangzhong
    Chen, Guoliang
    Yao, Xin
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2009, 39 (05): : 1092 - 1106
  • [17] Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables
    Bosu Choi
    Mark A. Iwen
    Felix Krahmer
    Foundations of Computational Mathematics, 2021, 21 : 275 - 329
  • [18] Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables
    Choi, Bosu
    Iwen, Mark A.
    Krahmer, Felix
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2021, 21 (02) : 275 - 329
  • [19] Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
    Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge
    MA, United States
    Leibniz Int. Proc. Informatics, LIPIcs,
  • [20] A NEW CLASS OF LARGE NEIGHBORHOOD PATH-FOLLOWING INTERIOR POINT ALGORITHMS FOR SEMIDEFINITE OPTIMIZATION WITH O(√n log Tr(X0 S0)/ε) ITERATION COMPLEXITY
    Li, Yang
    Terlaky, Tamas
    SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (06) : 2853 - 2875
12