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 条
  • [41] Divide and conquer technique for network fault management
    Ohta, K
    Mori, T
    Kato, N
    Sone, H
    Mansfield, G
    Nemoto, Y
    INTEGRATED NETWORK MANAGEMENT V: INTEGRATED MANAGEMENT IN A VIRTUAL WORLD, 1997, : 675 - 687
  • [42] Solution to Graph Coloring Problem using Divide and Conquer based Genetic Method
    Marappan, Raja
    Sethumadhavan, Gopalakrishnan
    2016 INTERNATIONAL CONFERENCE ON INFORMATION COMMUNICATION AND EMBEDDED SYSTEMS (ICICES), 2016,
  • [43] The application research on improved divide-and-conquer mixed selection algorithm for arrangement of examination seat
    Cao, Shuguo
    Song, Yonglei
    MECHATRONICS AND INDUSTRIAL INFORMATICS, PTS 1-4, 2013, 321-324 : 2352 - 2356
  • [44] Research on parallel collision detection algorithm based on pipelining and divide-and-conquer
    Zhao, Wei
    He, Yanshuang
    Li, Wenhui
    PROGRESS IN INTELLIGENCE COMPUTATION AND APPLICATIONS, PROCEEDINGS, 2007, : 277 - 282
  • [45] DIVIDE-AND-CONQUER ALGORITHMS FOR THE BANDSYMMETRIC EIGENVALUE PROBLEM
    ARBENZ, P
    PARALLEL COMPUTING, 1992, 18 (10) : 1105 - 1128
  • [46] Multi - Warehouse Location of Logistics Based on Dijkstra and Divide-and-Conquer Algorithm
    Hou, Donggu
    Zhang, Wei
    2017 10TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL. 1, 2017, : 442 - 447
  • [47] Orthogonal Complement Based Divide-and-Conquer Algorithm for constrained multibody systems
    Rudranarayan M. Mukherjee
    Kurt S. Anderson
    Nonlinear Dynamics, 2007, 48 : 199 - 215
  • [48] A New Divide and Conquer based SVD Algorithm for Beamforming Matrix for MIMO Systems
    Ahn, Minki
    Lee, Wookbong
    Jeon, Eunsung
    Kim, Sungsoo
    Kim, Joonsuk
    2019 IEEE 90TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-FALL), 2019,
  • [49] Modified artificial bee colony algorithm based on divide-and-conquer strategy
    School of Information Science and Engineering, Shandong Normal University, Ji'nan
    250014, China
    Kongzhi yu Juece Control Decis, 2 (316-320):
  • [50] The Divide-and-Conquer Deployment Algorithm Based on Triangles for Wireless Sensor Networks
    Shiu, Liang Cheng
    Lee, Chao Yang
    Yang, Chu Sing
    IEEE SENSORS JOURNAL, 2011, 11 (03) : 781 - 790
12345