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 条
  • [1] A Probabilistic Divide and Conquer Algorithm for the Minimum Tollbooth Problem
    Nickerl, Julian
    COMPUTATIONAL DATA AND SOCIAL NETWORKS, 2019, 11917 : 3 - 15
  • [2] Divide-and-Conquer Information-Based Optimal Subdata Selection Algorithm
    Wang, HaiYing
    JOURNAL OF STATISTICAL THEORY AND PRACTICE, 2019, 13 (03)
  • [3] Divide-and-Conquer Information-Based Optimal Subdata Selection Algorithm
    HaiYing Wang
    Journal of Statistical Theory and Practice, 2019, 13
  • [4] AN ACCELERATED DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD PROBLEM
    Li, Shengguo
    Gu, Ming
    Cheng, Lizhi
    Chi, Xuebin
    Sun, Meng
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2014, 35 (03) : 1038 - 1057
  • [5] A PRACTICAL DIVIDE-AND-CONQUER ALGORITHM FOR THE RECTANGLE INTERSECTION PROBLEM
    GUTING, RH
    SCHILLING, W
    INFORMATION SCIENCES, 1987, 42 (02) : 95 - 112
  • [6] A divide-and-conquer based improved genetic algorithm for network selection in heterogeneous wireless network
    Sun, Hui
    Yang, Chuang
    Wang, Rui
    Ghauri, Sabir
    INTERNATIONAL JOURNAL OF MODELLING IDENTIFICATION AND CONTROL, 2020, 34 (03) : 217 - 224
  • [7] TOWARDS A DIVIDE-AND-CONQUER ALGORITHM FOR THE REAL NONSYMMETRIC EIGENVALUE PROBLEM
    ADAMS, L
    ARBENZ, P
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1994, 15 (04) : 1333 - 1353
  • [8] Divide and Conquer Ray Tracing Algorithm based on BVH Partition
    Wu Zhefu
    Yu Hong
    Chen Bin
    2013 INTERNATIONAL CONFERENCE ON VIRTUAL REALITY AND VISUALIZATION (ICVRV 2013), 2013, : 49 - 55
  • [9] A divide-and-conquer discretization algorithm
    Min, F
    Xie, LJ
    Liu, QH
    Cai, HB
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 1, PROCEEDINGS, 2005, 3613 : 1277 - 1286
  • [10] A Quick Algorithm for Attribute Reduction Based on Divide and Conquer Method
    Hu, Feng
    Chen, Xi
    Wang, Xiaoyan
    Luo, Chuanjiang
    MANUFACTURING SYSTEMS AND INDUSTRY APPLICATIONS, 2011, 267 : 92 - 97
12345