Efficient Learning for Selecting Important Nodes in Random Network
暂无分享,去创建一个
Yijie Peng | Xiaoyun Xu | Chun-Hung Chen | Haidong Li | Chun-Hung Chen | Yijie Peng | Xiaoyun Xu | Haidong Li
[1] Marina Schmid,et al. Design And Analysis Of Experiments For Statistical Selection Screening And Multiple Comparisons , 2016 .
[2] Richard Barrett,et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.
[3] L. D. Costa,et al. Accessibility in complex networks , 2008 .
[4] Loo Hay Lee,et al. Efficient Simulation Budget Allocation for Selecting an Optimal Subset , 2008, INFORMS J. Comput..
[5] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[6] Weiwei Chen,et al. A note on the subset selection for simulation optimization , 2015, 2015 Winter Simulation Conference (WSC).
[7] David J. Hand,et al. Who's #1? The science of rating and ranking , 2012 .
[8] Panos M. Pardalos,et al. Approximate dynamic programming: solving the curses of dimensionality , 2009, Optim. Methods Softw..
[9] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[10] A. Govan,et al. Ranking Theory with Application to Popular Sports. , 2008 .
[11] Loo Hay Lee,et al. Stochastic Simulation Optimization - An Optimal Computing Budget Allocation , 2010, System Engineering and Operations Research.
[12] Bryan Sims. InvestorRank and an Inverse Problem for PageRank , 2012 .
[13] Chun-Hung Chen,et al. Dynamic Sampling Allocation and Design Selection , 2016, INFORMS J. Comput..
[14] Y. Rinott. On two-stage selection procedures and related probability-inequalities , 1978 .
[15] A. Law,et al. A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation , 1985 .
[16] Michael C. Fu,et al. Myopic Allocation Policy With Asymptotically Optimal Sampling Rate , 2017, IEEE Transactions on Automatic Control.
[17] William J. Stewart,et al. Introduction to the numerical solution of Markov Chains , 1994 .
[18] Weiwei Chen,et al. Efficient subset selection for the expected opportunity cost , 2015, Autom..
[19] Yicheng Zhang,et al. Identifying influential nodes in complex networks , 2012 .
[20] Loo Hay Lee,et al. An improved simulation budget allocation procedure to efficiently select the optimal subset of many alternatives , 2012, 2012 IEEE International Conference on Automation Science and Engineering (CASE).
[21] Daniele Alpago,et al. Identification of Sparse Reciprocal Graphical Models , 2018, IEEE Control Systems Letters.
[22] Chun-Hung Chen,et al. Ranking and Selection as Stochastic Control , 2017, IEEE Transactions on Automatic Control.
[23] Barry L. Nelson,et al. A fully sequential procedure for indifference-zone selection in simulation , 2001, TOMC.
[24] Yijie Peng,et al. Efficient Simulation Resource Sharing and Allocation for Selecting the Best , 2013, IEEE Transactions on Automatic Control.
[25] Stephen E. Chick,et al. New Two-Stage and Sequential Procedures for Selecting the Best Simulated System , 2001, Oper. Res..
[26] Siripun Sanguansintukul,et al. CiteRank: combination similarity and static ranking with research paper searching , 2011 .
[27] Amy Nicole Langville,et al. Google's PageRank and beyond - the science of search engine rankings , 2006 .
[28] Hui Xiao,et al. Efficient Simulation Budget Allocation for Ranking the Top Designs , 2014 .
[29] Stephen P. Borgatti,et al. Centrality and network flow , 2005, Soc. Networks.
[30] Chun-Hung Chen,et al. Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization , 2000, Discret. Event Dyn. Syst..