{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T01:10:09Z","timestamp":1750900209139,"version":"3.41.0"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811064418"},{"type":"electronic","value":"9789811064425"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-6442-5_56","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T05:54:47Z","timestamp":1507182887000},"page":"594-609","source":"Crossref","is-referenced-by-count":0,"title":["A Load Balancing Strategy for Monte Carlo Method in PageRank Problem"],"prefix":"10.1007","author":[{"given":"Bo","family":"Shao","sequence":"first","affiliation":[]},{"given":"Siyan","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Xiaola","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,6]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: 7th International World Wide Web Conference, Brisbane, Australia (1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte Carlo methods in pagerank computation: when one iteration is sufficient. SIAM J. Numer. Anal. 45(2) (2007)","DOI":"10.1137\/050643799"},{"key":"56_CR3","unstructured":"Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Internet Technology (2002, to appear)"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Moler, C.D., Moler, K.A.: Numerical Computing with MATLAB. SIAM, New Delhi (2003)","DOI":"10.1137\/1.9780898717952"},{"key":"56_CR5","unstructured":"Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Internet Technol. (2002, to appear)"},{"issue":"2","key":"56_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1012205210377","volume":"3","author":"LA Breyer","year":"2001","unstructured":"Breyer, L.A., Roberts, G.O.: Catalytic perfect simulation. Methodol. Comput. Appl. Probab. 3(2), 161\u2013177 (2001)","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"56_CR7","unstructured":"Litvak, N.: Monte Carlo methods of PageRank computation. Department of Applied Mathematics, University of Twente (2004)"},{"issue":"2","key":"56_CR8","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1137\/050643799","volume":"45","author":"K Avrachenkov","year":"2007","unstructured":"Avrachenkov, K., Litvak, N., Nemirovsky, D., Osipova, N.: Monte Carlo methods in PageRank computation: when one iteration is sufficient. SIAM J. Numer. Anal. 45(2), 890\u2013904 (2007)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"56_CR9","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1109\/TNNLS.2015.2424999","volume":"27","author":"C Cervellera","year":"2016","unstructured":"Cervellera, C., Macci\u00f2, D.: Low-discrepancy points for deterministic assignment of hidden weights in extreme learning machines. IEEE Trans. Neural Netw. Learn. Syst. 27(4), 891\u2013896 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Gan, G., Valdez, E.A.: An empirical comparison of some experimental designs for the valuation of large variable annuity portfolios. Dependence Model. 4(1) (2016)","DOI":"10.1515\/demo-2016-0022"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Zapotecas-Mart\u00ednez, S., Aguirre, H.E., Tanaka, K., et al.: On the low-discrepancy sequences and their use in MOEA\/D for high-dimensional objective spaces. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 2835\u20132842. IEEE (2015)","DOI":"10.1109\/CEC.2015.7257241"},{"key":"56_CR12","unstructured":"Sarma, A.D., et al.: Fast distributed PageRank computation. Theoret. Comput. Sci. 561, 113\u2013121 (2015)"},{"key":"56_CR13","doi-asserted-by":"crossref","unstructured":"Andersch, M., Lucas, J., Lvlvarez-Mesa, M.A., et al.: On latency in GPU throughput microarchitectures. In: 2015 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pp. 169\u2013170. IEEE (2015)","DOI":"10.1109\/ISPASS.2015.7095801"},{"key":"56_CR14","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Preprint, North Carolina State University (2003)"},{"key":"56_CR15","doi-asserted-by":"crossref","unstructured":"Yang, W., Zheng, P.: An improved PageRank algorithm based on time feedback and topic similarity. In: 2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS), Beijing, pp. 534\u2013537 (2016)","DOI":"10.1109\/ICSESS.2016.7883126"},{"key":"56_CR16","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Stanford Digit. Libr. Working Paper 9(1), 1\u201314 (1999)"},{"key":"56_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1629096.1629097","volume":"27","author":"P Boldi","year":"2009","unstructured":"Boldi, P., Santini, M., Vigna, S.: Page rank: functional dependencies. ACM Trans. Inf. Syst. 27, 1\u201323 (2009)","journal-title":"ACM Trans. Inf. Syst."},{"key":"56_CR18","doi-asserted-by":"crossref","first-page":"19735","DOI":"10.1073\/pnas.0708838104","volume":"104","author":"F Chung","year":"2007","unstructured":"Chung, F.: The heat Kernel as the PageRank of a graph. Proc. Natl. Acad. Sci. U.S.A. 104, 19735\u201319740 (2007)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"56_CR19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"AN Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"issue":"3","key":"56_CR20","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/0126044","volume":"26","author":"CD Meyer","year":"1974","unstructured":"Meyer, C.D.: Limits and the index of a square matrix. SIAM J. Appl. Math. 26(3), 469\u2013478 (1974)","journal-title":"SIAM J. Appl. Math."},{"key":"56_CR21","unstructured":"Vigna, S.: Spectral Ranking, November 2013"},{"key":"56_CR22","unstructured":"Leskovec, J., Krevl, A.: {SNAP Datasets}:{Stanford} Large Network Dataset Collection (2015)"}],"container-title":["Communications in Computer and Information Science","Parallel Architecture, Algorithm and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-6442-5_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T00:33:39Z","timestamp":1750898019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-6442-5_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811064418","9789811064425"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-6442-5_56","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}