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 条

[21] A divide-and-conquer-based algorithm for automatic simulation vector generation
Yen, CC
Jou, JY
Chen, KC
IEEE DESIGN & TEST OF COMPUTERS, 2004, 21 (02): : 111 - 120
[22] Quartets MaxCut: A Divide and Conquer Quartets Algorithm
Snir, Sagi
Rao, Satish
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2010, 7 (04) : 704 - 718
[23] An effective solution for redistricting based on divide-conquer and genetic algorithm
Pang, Shanchen
Guan, Xiaowei
Lin, Zhihui
Wang, Leizhi
DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2007, 14 : 950 - 956
[24] A divide and conquer deformable contour method with a model based searching algorithm
Wang, X
He, L
Tang, YJ
Wee, WG
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2003, 33 (05): : 738 - 751
[25] A stable divide and conquer algorithm for the unitary eigenproblem
Gu, M
Guzzo, R
Chi, XB
Cao, XQ
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2003, 25 (02) : 385 - 404
[26] A DIVIDE-AND-CONQUER ALGORITHM FOR GRID GENERATION
DOUGHERTY, RL
HYMAN, JM
APPLIED NUMERICAL MATHEMATICS, 1994, 14 (1-3) : 125 - 134
[27] Parallel implementation of a divide and conquer semiempirical algorithm
Vincent, JJ
Dixon, SL
Merz, KM
THEORETICAL CHEMISTRY ACCOUNTS, 1998, 99 (04) : 220 - 223
[28] Phase unwrapping based on network flow algorithm and divide & conquer strategy
Li, G
Xiaoyang, W
Hong, Z
Chao, W
IGARSS 2005: IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM, VOLS 1-8, PROCEEDINGS, 2005, : 4829 - 4831
[29] An Efficient Multibody Divide and Conquer Algorithm and Implementation
Critchley, James H.
Anderson, Kurt S.
Binani, Adarsh
JOURNAL OF COMPUTATIONAL AND NONLINEAR DYNAMICS, 2009, 4 (02): : 1 - 10
[30] An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case
Pereira, Jose C.
Lobo, Fernando G.
JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2012, 27 (04) : 891 - 896

← 1 2 3 4 5 →