乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:59:49Z","timestamp":1725854389060},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319390765"},{"type":"electronic","value":"9783319390772"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39077-2_3","type":"book-chapter","created":{"date-parts":[[2016,5,2]],"date-time":"2016-05-02T13:00:15Z","timestamp":1462194015000},"page":"30-41","source":"Crossref","is-referenced-by-count":0,"title":["Improved Survey Propagation on Graphics Processing Units"],"prefix":"10.1007","author":[{"given":"Yang","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Jingfei","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Pengbo","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,3]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/S0097539703434231","volume":"36","author":"D Achlioptas","year":"2006","unstructured":"Achlioptas, D., Moore, C.: Random k-SAT: two moments suffice to cross a sharp threshold. SIAM J. Comput. 36(3), 740\u2013762 (2006)","journal-title":"SIAM J. Comput."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Braunstein, A., M\u00e9zard, M., Weigt, M., Zecchina, R.: Constraint satisfaction by survey propagation. In: Computational Complexity and Statistical Physics, p. 107 (2005)","DOI":"10.1093\/oso\/9780195177374.003.0011"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein, A., M\u00e9zard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Struct. Algorithms 27(2), 201\u2013226 (2005)","journal-title":"Random Struct. Algorithms"},{"issue":"06","key":"3_CR4","doi-asserted-by":"publisher","first-page":"P06007","DOI":"10.1088\/1742-5468\/2004\/06\/P06007","volume":"2004","author":"A Braunstein","year":"2004","unstructured":"Braunstein, A., Zecchina, R.: Survey propagation as local equilibrium equations. J. Stat. Mech. Theory Exp. 2004(06), P06007 (2004)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"3_CR6","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)"},{"key":"3_CR7","first-page":"1","volume":"8","author":"H Fujii","year":"2012","unstructured":"Fujii, H., Fujimoto, N.: GPU acceleration of BCP procedure for SAT algorithms. IPSJ SIG Notes 8, 1\u20136 (2012)","journal-title":"IPSJ SIG Notes"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"RG Gallager","year":"1962","unstructured":"Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21\u201328 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"LA Levin","year":"1986","unstructured":"Levin, L.A.: Average case complete problems. SIAM J. Comput. 15(1), 285\u2013286 (1986)","journal-title":"SIAM J. Comput."},{"key":"3_CR10","unstructured":"Luo, Z., Liu, H.: Cellular genetic algorithms and local search for 3-SAT problem on graphic hardware. In: IEEE Congress on Evolutionary Computation, CEC 2006, pp. 2988\u20132992. IEEE (2006)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/11814948_30","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"P Manolios","year":"2006","unstructured":"Manolios, P., Zhang, Y.: Implementing survey propagation on graphics processing units. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 311\u2013324. Springer, Heidelberg (2006)"},{"issue":"5582","key":"3_CR12","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1126\/science.1073287","volume":"297","author":"M M\u00e9zard","year":"2002","unstructured":"M\u00e9zard, M., Parisi, G., Zecchina, R.: Analytic and algorithmic solution of random satisfiability problems. Science 297(5582), 812\u2013815 (2002)","journal-title":"Science"},{"key":"3_CR13","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J Pearl","year":"2014","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Burlington (2014)"},{"key":"3_CR14","first-page":"027","volume":"6","author":"T Tao","year":"2012","unstructured":"Tao, T., Xuejun, Y., Yisong, L.: Locality analysis and optimization for stream programs based on iteration sequence. J. Comput. Res. Dev. 6, 027 (2012)","journal-title":"J. Comput. Res. Dev."},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-1-4612-1872-2_12","volume-title":"Complexity Theory Retrospective II","author":"Jie Wang","year":"1997","unstructured":"Wang, J.: Average-case computational complexity theory. In: Complexity Theory Retrospective II, pp. 295\u2013328 (1997)"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10586-013-0300-9","volume":"17","author":"M Wen","year":"2014","unstructured":"Wen, M., Su, H., Wei, W., Wu, N., Cai, X., Zhang, C.: High efficient sedimentary basin simulations on hybrid CPU-GPU clusters. Cluster Comput. 17(2), 359\u2013369 (2014)","journal-title":"Cluster Comput."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-63104-6_28","volume-title":"Automated Deduction - CADE-14","author":"H Zhang","year":"1997","unstructured":"Zhang, H.: SATO: an efficient prepositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 272\u2013275. Springer, Heidelberg (1997)"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.1996.0030","volume":"21","author":"H Zhang","year":"1996","unstructured":"Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: a distributed propositional prover and its application to quasigroup problems. J. Symbolic Comput. 21(4), 543\u2013560 (1996)","journal-title":"J. Symbolic Comput."}],"container-title":["Lecture Notes in Computer Science","Green, Pervasive, and Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39077-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T15:39:43Z","timestamp":1655653183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39077-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319390765","9783319390772"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39077-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}