Parallel algorithm of selecting the best subset on Cp criterion

被引:0
|
作者
Hu, Qingjun
Wu, Yi
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] A fast bit-parallel algorithm for computing the subset partial order
    Pritchard, P
    ALGORITHMICA, 1999, 24 (01) : 76 - 86
  • [42] A Fast Bit-Parallel Algorithm for Computing the Subset Partial Order
    P. Pritchard
    Algorithmica, 1999, 24 : 76 - 86
  • [43] A parallel hill-climbing algorithm to generate a subset of irreducible testors
    Piza-Davila, Ivan
    Sanchez-Diaz, Guillermo
    Aguirre-Salado, Carlos A.
    Lazo-Cortes, Manuel S.
    APPLIED INTELLIGENCE, 2015, 42 (04) : 622 - 641
  • [44] A GPU parallel algorithm for finding a negative subset disjoint cycle in a graph
    Sielski, Piotr
    Corduk, Akif
    Linsenmaier, Hugo
    Fender, Alex
    2023 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE, HPEC, 2023,
  • [45] Massively-Parallel Best Subset Selection for Ordinary Least-Squares Regression
    Gieseke, Fabian
    Polsterer, Kai Lars
    Mahabal, Ashish
    Igel, Christian
    Heskes, Tom
    2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017,
  • [46] SELECTING BEST POPULATION
    ALAM, K
    WALLENIUS, KT
    COMMUNICATIONS IN STATISTICS PART A-THEORY AND METHODS, 1977, 6 (11): : 1091 - 1104
  • [47] Selecting the best material
    Hunt, MW
    ADVANCED MATERIALS & PROCESSES, 1996, 149 (06): : 2 - 2
  • [48] ON SELECTING THE BEST CONTENDER
    LEE, YJ
    DUDEWICZ, EJ
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1986, 16 (02) : 135 - 143
  • [49] Selecting the best equipment
    Tatterson, G
    CHEMICAL PROCESSING, 2001, 64 (09): : 10 - 10
  • [50] SELECTING THE BRIGHTEST AND THE BEST
    ROOSE, D
    MITCHELL, S
    RUDMAN, MK
    PHI DELTA KAPPAN, 1985, 67 (03) : 219 - 221