A Selection Problem for Management Based on Divide and Conquer Algorithm

被引：0
|
作者：
Wang, Xiaohui [1 ]
Zhang, Yong [2 ]
Zhao, Hongyan [3 ]
机构：
[1] Shandong Univ Finance, Sch Comp & Informat Engn, Jinan, Peoples R China
[2] Shandong Agr Univ, Econ Management Coll, Tai An, Shandong, Peoples R China
[3] Shandong Yingcai Univ, Sch Comp & Informat Engn, Jinan, Peoples R China
来源：
2009 IITA INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS ENGINEERING, PROCEEDINGS | 2009年
关键词：
selection problem; MCMC; Divide and Conquer Algorithm; GLOBAL OPTIMIZATION;
D O I：
10.1109/CASE.2009.152
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Selection problem, which is to find the k th smallest element in a sequence of n numbers in arbitrary order, is a typical problem in algorithm design and analysis. The select problem is solved by divide and conquer algorithm. The general algorithm is given, and the complexity of this algorithm is analyzed and discussed. The Divide and Conquer algorithms are related to backfitting and Markov chain Monte Carlo techniques, which divide the problem in a divide and conquer strategy into smaller pieces. Confidence intervals taking model uncertainty into account are based on the bootstrap in combination with MCMC techniques.
引用
收藏
页码：160 / +
页数：2
相关论文
共 50 条
  • [31] TOWARD A HIGH PERFORMANCE TILE DIVIDE AND CONQUER ALGORITHM FOR THE DENSE SYMMETRIC EIGENVALUE PROBLEM
    Haidar, Azzam
    Ltaief, Hatem
    Dongarra, Jack
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (06): : C249 - C274
  • [32] A DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD
    GU, M
    EISENSTAT, SC
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1995, 16 (01) : 79 - 92
  • [33] Parallel implementation of a divide and conquer semiempirical algorithm
    James J. Vincent
    Steven L. Dixon
    Kenneth M. Merz Jr.
    Theoretical Chemistry Accounts, 1998, 99 : 220 - 223
  • [34] A divide-and-conquer algorithm for curve fitting
    Buchinger, Diego
    Rosso Jr, Roberto Silvio Ubertino
    COMPUTER-AIDED DESIGN, 2022, 151
  • [35] A Divide and Conquer Algorithm for Electron Microscopy Segmentation
    Jebril, Ruba
    Zhu, Yingde
    Chen, Wei
    Al Nasr, Kamal
    ACM-BCB 2020 - 11TH ACM CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY, AND HEALTH INFORMATICS, 2020,
  • [36] An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
    Jos C.Pereira
    Fernando G.Lobo
    JournalofComputerScience&Technology, 2012, 27 (04) : 891 - 896
  • [37] Divide & Conquer Classification and Optimization by Genetic Algorithm
    Parvin, Hamid
    Alizadeh, Hosein
    Moshki, Mohsen
    Minaei-Bidgoli, Behrouz
    Mozayani, Naser
    THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 2, PROCEEDINGS, 2008, : 858 - 863
  • [38] A divide and conquer algorithm for rectilinear region coverage
    Agarwal, A
    Lim, MH
    Woon, LC
    2004 IEEE CONFERENCE ON ROBOTICS, AUTOMATION AND MECHATRONICS, VOLS 1 AND 2, 2004, : 996 - 1001
  • [39] An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
    José C. Pereira
    Fernando G. Lobo
    Journal of Computer Science and Technology, 2012, 27 : 891 - 896
  • [40] Fast broadcast by the divide-and-conquer algorithm
    Kim, DY
    Kim, DS
    2004 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING, 2004, : 487 - 488
12345